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

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

Date: Sat, 10 Jul 2004 15:14:27 GMT

> >***************************************************
> >All that is required is that the meaning of the reply be
> >kept from the counter-example program. The WillHalt()
> >Function arranges a coded reply to the human user.
> >
> >It could be as simple as one and zero. The meaning of true
> >would be assigned to either one or zero, the meaning of
> >false would be assigned to the other. Before the program
> >takes the input of the counter-example program it outputs
> >either a one or a zero to the screen. Whichever (1 or 0) is
> >output, holds the meaning of true. Whichever one it outputs
> >is generated by a hardware noise based random number
> >generator. Now the counter-example program has no way
> >to thwart the WillHalt() function, and the human user can
> >understand the result.
> >***************************************************
>
> OK. (I'll even ignore the fact that Turing machines don't have
> screens.) Now one of the following will be the counter example.

It seems that I did need to state that the counter-example program
can not see the screen. I thought that this aspect of my intention
would have been inferred, and not need to be stated.

Relevant Pages
Loading