Re: Yet another Attempt at Disproving the Halting Problem

newstome_at_comcast.net
Date: 07/30/04


Date: Fri, 30 Jul 2004 04:01:52 GMT

In comp.theory Peter Olcott <olcott@worldnet.att.net> wrote:
> "Andrew Koenig" <ark@acm.org> wrote in message news:rMWNc.343675$Gx4.171189@bgtnsc04-news.ops.worldnet.att.net...
>> "Peter Olcott" <olcott@worldnet.att.net> wrote in message
>> news:NzWNc.343612$Gx4.197834@bgtnsc04-news.ops.worldnet.att.net...
>>
>> > First of all this is flatly incorrect. The Halting Problem does not
>> > say that a Halt Analyzer can not ever exist. All that it says is that
>> > under certain weird circumstances it would not produce the correct
>> > results.
>>
>> I see no difference between these two claims. Would you explain what you
>> mean, please?
>
> He claimed that no program can ever tell if any other program will
> halt. In other words a program without any loops could not be
> determined to halt.

??? What exactly do you mean here? Of course there are algorithms
that can determine if certain restricted classes of programs halt
(such as programs without any loops). But a solution to the halting
problem has to work for *ANY* input, meaning you don't get to
restrict the input like that -- it would have to work on any program
with loops as well. If there's even one input (program) that it
doesn't work for, then it's not a solution to the halting problem.

-- 
That's News To Me!
newstome@comcast.net


Relevant Pages

  • Re: Yet another Attempt at Disproving the Halting Problem
    ... In other words a program without any loops could not be ... > determined to halt. ... that can determine if certain restricted classes of programs halt ... then it's not a solution to the halting problem. ...
    (comp.lang.cpp)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... In other words a program without any loops could not be ... > determined to halt. ... that can determine if certain restricted classes of programs halt ... then it's not a solution to the halting problem. ...
    (sci.logic)
  • Re: Alan Turings Halting Problem is incorrectly formed (PART-TWO)
    ... :> In comp.theory Peter Olcott wrote: ... the Halting Problem has a correct answer. ... :> halts or does not halt for a given input. ... halts or loops for a given input. ...
    (comp.theory)
  • Re: Alan Turings Halting Problem is incorrectly formed (PART-TWO)
    ... :> In comp.theory Peter Olcott wrote: ... the Halting Problem has a correct answer. ... :> halts or does not halt for a given input. ... halts or loops for a given input. ...
    (sci.logic)
  • Re: simple and beauty strategy
    ... the halting problem is a decision problem ... Alan Turing proved in 1936 that a general algorithm to solve the ... the program will eventually halt when run with that input. ... undecidability of a problem in the lambda calculus had already been ...
    (rec.gambling.lottery)