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 by some
turing machine...still while every sucess in this
direction will strengthen our conviction of the
truth of the hypothesis,it will not lead to a proof.
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")
Is the defenition not possible because of the
incompleteness theorom?
why exactly is it undefinable?
Also have can we distinguish between provable and
unprovable statements.
Regards Data.
__________________________________________________
Do You Yahoo!?
HotJobs - Search Thousands of New Jobs
http://www.hotjobs.com
