On Mon, Dec 10, 2012 at 6:02 PM, Aaron Hosford <[email protected]> wrote:
> Constraining the search space and using boundaries with transcendent >> overlaps are ways which our programs might avoid combinatorial explosions. >> And we can use branching indexes as a means to find more detailed >> information. Then, if particular 'ideas' are more closely associated with >> particular index branches (or with other 'ideas' that are associatively >> distributed in a similar way) they might not come to mind unless there is >> some other reason to be looking at that particular group of 'ideas'. If >> 'ideas' should be associated with other groups of ideas (or at other points >> on the index) then they can be cross associated. However, the index >> associations should be categorized or sub indexed in some way so that the >> system does not become overwhelmed by associating all 'ideas' at the root >> or initial path into the index. > > > This is exactly what I was getting at with the OO analogy. You are talking > about encapsulation in different words. > It was intentional. Jim Bromer ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
