[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 equal to the power of a typical digital
> computer?
Actually what it says is that -all- computing devices can be reduced to a
TM. A TM is a -universal- computing machine.
>how can we defend or refute sucha hypotheis?
Show something a digital or analog computer can do that a TM can't or visa
versa.
> The difficulty lies in the fact that we dont exactly
> know what is meant exactly by " a typical digital
> computer and we have no means of making a precise
> defenition")
We don't care either, the point is that -all- are equivalent, not -some-.
> Is the defenition not possible because of the
> incompleteness theorom?
Irrelevant. It has to do with what one means by 'computation'.
> why exactly is it undefinable?
What is undefinable?
> Also have can we distinguish between provable and unprovable statements.
That is an unsolvable problem if you are looking for a general approach to
-any- statement, that -is- Godel's.
--
____________________________________________________________________
Conform and be dull......J. Frank Dobie
[EMAIL PROTECTED] www.ssz.com
[EMAIL PROTECTED] www.open-forge.org
--------------------------------------------------------------------
