--- On Wed, 10/15/08, Vladimir Nesov <[EMAIL PROTECTED]> wrote: > Interstellar void must be astronomically intelligent, with > all its incompressible noise...
How do you know it's not compressible? Compression is not computable. To give a concrete example, the output of RC4 looks like random noise if you don't know the key. Yet it is extremely simple algorithmically. http://en.wikipedia.org/wiki/RC4 More generally, the universe might be simulated by the following algorithm: enumerate all Turing machines until life is found, running the n'th machine for n steps. In this case, the universe (including your interstellar void) has a complexity of log2 H = 407 bits, where H is the Bekenstein bound of the Hubble radius, 2.91 x 10^122 bits. (Anyway, this is aside from my point that you apparently missed, that algorithmic complexity is an upper bound on intelligence only). -- Matt Mahoney, [EMAIL PROTECTED] ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=117534816-b15a34 Powered by Listbox: http://www.listbox.com
