Re: Yet another Attempt at Disproving the Halting Problem
Date: Fri, 30 Jul 2004 04:01:52 GMT
In comp.theory Peter Olcott <firstname.lastname@example.org> wrote:
> "Andrew Koenig" <email@example.com> wrote in message news:rMWNc.343675$Gx4.firstname.lastname@example.org...
>> "Peter Olcott" <email@example.com> wrote in message
>> > 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! firstname.lastname@example.org