Re: Halting Problem Final Conclusion

From: Michael Mueller (michael.mueller42_at_freenet.de)
Date: 09/06/04 

Date: Mon, 06 Sep 2004 00:12:52 +0200

Peter Olcott wrote:
> Now we have three possible correct results:
> (a) Halts
> (b) Does Not Halt
> (c) Pathological Self Reference to Halt
[...]

This is completely irrelevant.

There are many other proves to show that there
is no algorithmic solution to the halting problem.

There are many other problems which also cannot
be solved by an algorithm.

And there must be problems which cannot be solved
by an algorithm because there are much more problems
than algorithms.

And finally:
To show that a problem can be solved by an algorithm,
you have to write down that algorithm
- this is the only acceptable way to do.

To discuss that one of the many proves is
possibly wrong, leads you nowhere.

Michael Mueller

Relevant Pages

  • Re: Solution to the halting Problem?
    ... Peter Olcott wrote: ... your WillHalt() tester is useless. ... >> And having an algorithm which produces absolutely no result ...
    (comp.lang.cpp)
  • Re: Solution to the halting Problem?
    ... Peter Olcott wrote: ... >> which form this result is presented is completely unimportant and ... >> such not part of the algorithm. ... Stewart. ...
    (comp.lang.cpp)
  • Re: Halting Problem Final Conclusion
    ... Peter Olcott wrote: ... by an algorithm because there are much more problems ... possibly wrong, leads you nowhere. ... Michael Mueller ...
    (sci.logic)
  • Image of a set of convergents
    ... leads to a plot of a set of convergents defined by a fairly simple ... algorithm. ...
    (sci.math)