Ben, you missed my point. We use Turing machines in all kinds of computer
science proofs, even though you can't build one. Turing machines have infinite
memory, so it is not unreasonable to assume that if Turing machines did exist,
then one could store the 2^409 bits needed to describe the quantum state of the
observable universe and then perform computations on that data to predict the
future.
I described how a Turing machine could obtain that knowledge in about 2^818
steps by enumerating all possible universes until intelligent life is found. As
evidence, I suggest that the algorithmic complexity of the free parameters in
string theory, general relativity, and the initial state of the Big Bang is on
the order of a few hundred bits.
-- Matt Mahoney, [EMAIL PROTECTED]
--- On Thu, 10/30/08, Ben Goertzel <[EMAIL PROTECTED]> wrote:
From: Ben Goertzel <[EMAIL PROTECTED]>
Subject: Re: [agi] "the universe is computable" [Was: Occam's Razor and its
abuse]
To: agi@v2.listbox.com
Date: Thursday, October 30, 2008, 6:02 PM
If I can assume that Turing machines exist, then I can assume perfect knowledge
of the state of the universe. It doesn't change my conclusion that the universe
is computable.
-- Matt Mahoney, [EMAIL PROTECTED]
1)
Turing machines are mathematical abstractions and don't physically exist
2)
I thought **I** had a lot of hubris but ... wow! Color me skeptical that you
possess perfect knowledge of the state of the universe ;-)
ben g
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/
Modify Your Subscription:
https://www.listbox.com/member/?member_id=8660244&id_secret=117534816-b15a34
Powered by Listbox: http://www.listbox.com
