Re: Can you find anything wrong with this solution to the Halting Problem?

From: Peter Olcott (olcott_at_att.net)
Date: 07/14/04 

Date: Wed, 14 Jul 2004 00:29:30 GMT

> And remember, the halting problem does not say "it is impossible to decide
> haltability for any machines at all", it says "it is impossible to decide the
> haltability for *all* possible machines" - therefore, it is impossible to make
> a T.M. that takes another T.M. as input and decides on its haltability.
>
> alex

That might be true. If it is true then my method that
disproves the conclusion of the Halting Problem also
effectively refutes the Church-Turing thesis.

http://home.att.net/~olcott/halts.html

Read it again, it keeps getting clearer as I perfect its
wording.