A Brute Force algorithm is Turing Complete too. It can let us test each
possible program out, see how it goes. But would take reallyyy long. The brain
Turing Complete Tape however does the same job but just faster because it uses
less resources. It takes less time because there's less rubbish. So brain=less
data needed, BF=lots of data. Why does it work? Because the more Big Diverse
Data you have the exponentially more data you actually have. So you get to have
as much data as BF but in a compressed small form, BF is too redundant (stores
the same thing 44 times, but only need to know it once!). This lets you get to
the same solution by multiple paths or starting conditions, just in a few steps
in the small world hierarchy network. Hierarchy acts as heterarchy using paths,
no need for heterarchy I think. The universe has the same physics in most
particles, so the larger scale you look on (5 particles, 50 particles, 500
particles) the more combinations that are possible but each is similar and each
scale is similar and so eventually the scale barely matters if have enough data
(we don't have that much data yet in our brain/internet servers).
------------------------------------------
Artificial General Intelligence List: AGI
Permalink:
https://agi.topicbox.com/groups/agi/T56d8c6758403c8e0-Me59d250da8ffe108ff875902
Delivery options: https://agi.topicbox.com/groups/agi/subscription
