Re: Alan Turing's Halting Problem is Incorrect (FINAL PART)

From: Peter Olcott (olcott_at_worldnet.att.net)
Date: 07/08/04 

Date: Thu, 08 Jul 2004 00:39:17 GMT

> Well of course the halting problem is artificially contrived, it's
> about Turing machines, which are artificially contrived.
>
> Martin

A TM is derived for the real purpose of determining the actual
limits of computation. TM's are perfectly valid and useful. They
provide an excellent means to study the foundations of computing
with a model of minimal complexity. The counter-example program
that proposes to prove the case of the Halting Problem is another
case entirely. It does not relate to anything real, or anything
possibly real, or even a comparable measure of a possible real
thing. It does not show the real limits of the potential capabilities
of automated program validation. It is purely an artificial contrivance
used to prove a pointless point.