Re: [CI] Re: Turing thesis(Incompleteness theorom)

hi, thank you Mr. Jim,one more query, regarding Godel's incompleteness theorom. 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. Call the program P(UTM) for Pr

Re: Turing thesis

[Can the admin of the cpunks-india list please contact me? I'd like to put a link w/ info on the SSZ CDR homepage. Thanks.] On Sat, 10 Aug 2002, gfgs pedo wrote: > Here is an example illustrating turing thesis > > { Suppose we make a conjecture that a turing machine > is e

Re: [CI] Re: Turing thesis(Incompleteness theorom)

At 11:58 AM -0700 on 8/11/02, James A. Donald wrote: > Choate's universe is a very strange place. One could even say it was, um, loopy... :-). Cheers, RAH -- - R. A. Hettinga The Internet Bearer Underwriting Corporation 44 Farquhar Street, Boston, MA

Re: [CI] Re: Turing thesis(Incompleteness theorom)

-- On 11 Aug 2002 at 10:36, Jim Choate wrote: > 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'. Choate's universe is a very strange place. --digsig James A. Dona

Re: [CI] Re: Turing thesis(Incompleteness theorom)

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

Turing thesis

hi, Here is an example illustrating turing thesis { Suppose we make a conjecture that a turing machine is equal to the power of a typical digital computer?how can we defend or refute sucha hypotheis? to defend it we could take an increasingly more difficult and show that they are solvable