Re: Alan Turing's Halting Problem is incorrectly formed (PART-TWO)

From: Stephan Lehmke (Stephan.Lehmke_at_ls1.cs.uni-dortmund.de)
Date: 06/29/04 

Date: 29 Jun 2004 14:30:32 GMT

In article <da5Ec.40344$OB3.26321@bgtnsc05-news.ops.worldnet.att.net>,
        "Peter Olcott" <olcott@worldnet.att.net> writes:
>
> <stephen@nomail.com> wrote in message
> news:cbqe6k$gdp$1@msunews.cl.msu.edu...
>> In comp.theory Peter Olcott <olcott@worldnet.att.net> wrote:
>> :> :> :> :> : bool LoopIfHalts (bool YouSayItHalts)
>> :> :> :> :> : {
>> :> :> :> :> : if (YouSayItHalts)
>> :> :> :> :> : while(true)
>> :> :> :> :> : ;
>> :> :> :> :> : else
>> :> :> :> :> : return false;
>> :> :> :> :> : }
>>
>>
>> :> No, I am not wrong. If the input is true, the program loops. If
>> :> the input is false, the program halts. How is that answer wrong?
>>
>> : Because the input of true also entails the English sentence:
>> : "This program will halt.", and of course you know that it
>> : will not halt.
>>
>> No. The input is just a boolean. The names of the program and
>> of the parameters are irrelevant.
>
> That is not how I am defining the problem.

So you have defined a different problem, unrelated to the Halting Problem.

So what?

I can define ten problems unrelated to the Halting Problem per minute.

regards
Stephan

Relevant Pages

  • Re: Alan Turings Halting Problem is incorrectly formed (PART-TWO)
    ... The input is just a boolean. ... > That is not how I am defining the problem. ... So you have defined a different problem, unrelated to the Halting Problem. ...
    (comp.theory)
  • Re: The Halting Problem is merely an erroneously formed question
    ... I mean the specific instance of the Halting Problem that has the structure such that every possible Boolean result is made to be the incorrect result. ... The only reason that the Halt TM can not provide the correct Boolean answer is that no correct Boolean answer can possibly exist. ... testing to see if it is a halting problem decider. ...
    (comp.theory)
  • The Halting Problem is merely an erroneously formed question
    ... The whole issue with the Halting Problem is that it erroneously restricts a tri-state problem to a bi-state (Boolean) result. ... It is that whether or not the target of its analysis halts in some cases has no possible correct Yes or No answer. ...
    (comp.theory)
  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... I am defining the term incorrect question as ... > synonymous with the term impossible question. ... So in other words the halting problem is solvable, ...
    (sci.logic)
  • Re: LSP
    ... Daniel T. wrote: ... If I construct something like the Halting problem (which is what I expect ... a value of true/false by definition. ... Regards, ...
    (comp.object)