On Sun, 11 Aug 2002, gfgs pedo wrote:
> with reference to > http://www.miskatonic.org/godel.html > > " > G�del asks for the program and the circuit design of > the UTM. The program may be complicated, but it can > only be finitely long. I know of no such requirement in Godel's Theorem, since I didn't write the above site I can't really address what they meant to say. I would suggest contacting the author for clarification. It's also worth mentioning that Godel announced his work in 1931, Turing in 1936. I'd be suspect of any comment about Godel that had anything to do with TM's in a 'proof'. 'Computabilty' and 'Proof/Consistency' are not equivalent. All Godel really says is that math, physics, etc. must be taken on -faith- with regard to 'consistency'. In other words, 'science' is just another 'religion'. The reason is that if you can't prove all statements then any statement you do 'prove' is suspect because there are statements out there that -might- express a boundary condition the original proof didn't take into account. Such statements themselves may be unprovable. This means that even 'proven' statements aren't -really- 'proven'. It's a 'Scope' problem. That's why I'm a Pantheist. Einstein was wrong, Hawkings was right. God not only plays with dice, he sometimes throws them where you can't see them (ever). -- ____________________________________________________________________ Conform and be dull......J. Frank Dobie [EMAIL PROTECTED] www.ssz.com [EMAIL PROTECTED] www.open-forge.org --------------------------------------------------------------------
