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

From: Kenneth Doyle (nobody_at_notmail.com)
Date: 07/10/04 

Date: Sat, 10 Jul 2004 04:52:49 GMT

"Peter Olcott" <olcott@att.net> wrote in
news:S0KHc.224565$Gx4.125452@bgtnsc04-news.ops.worldnet.att.net:

> 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.
>

Wow! This just keeps getting more and more precise, doesn't it? 

-- 
CodeCutter - good, fast and cheap; pick two.

Relevant Pages

  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... >>All that is required is that the meaning of the reply be ... > program knowing what the WillHalt function returns. ... the counter-example program explicitly depends upon WillHalt ... construed as either Boolean true, or Boolean false, it would ...
    (sci.logic)
  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... >>All that is required is that the meaning of the reply be ... >>Function arranges a coded reply to the human user. ... > screens.) ... It seems that I did need to state that the counter-example program ...
    (sci.logic)
  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... this counter-example program halts is analytically impossible. ... >>It is not an analytical impossibility to determine which inputs ... terms of the original Halting Problem, ... WillHalt() function has knowledge about halting at least equal ...
    (sci.logic)
  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... >>No a random mapping will do. ... All that is required is that the meaning of the reply be ... kept from the counter-example program. ... It could be as simple as one and zero. ...
    (sci.logic)
  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... >> Speed limits and the limits to computability that Turing prooved are ... >All that is required is that the meaning of the reply be ... >kept from the counter-example program. ... program knowing what the WillHalt function returns. ...
    (sci.logic)