You'd have to repeat that in Math, or Algorithms and Data Structures to make it
comprehensible (to me).
There are too many concepts such as "boundaries with transcendent overlaps"
that are private to you alone.
But I suppose you're understanding my method. List the requirements,
constraints, dependencies, and assumptions. Then find a solution to address
them all. Iterate until done. Very simple.
Cheers!
Date: Mon, 10 Dec 2012 14:30:28 -0500
Subject: Re: [agi] Internal Representation
From: [email protected]
To: [email protected]
So the program needs to be able to form 'ideas' but then it needs to be able to
use them in different ways. For example you may know something and use that
knowledge in your thinking without necessarily acting on that particular piece
of knowledge. We can talk about an explosion without actually exploding
something.
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.
AGI | Archives
| Modify
Your Subscription
-------------------------------------------
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
