Re: Can you find anything wrong with this solution to the Halting Problem?

From: G. Frege (no_spam_at_aol.com)
Date: 07/23/04 

Date: Fri, 23 Jul 2004 02:02:41 +0200

On Thu, 22 Jul 2004 23:47:34 GMT, "Peter Olcott"
<olcott@worldnet.att.net> wrote:

> >
> > Admittedly, it would be mildly interesting to work on the details.
> > However, assuming the equivalence (in the case of a TM emulating
> > an infinite-register machine, it's mostly a matter of organizing
> > things AFAICT), if the halting problem can be solved for one, it
> > can be solved for the other -- or, as it turns out, neither one
> > can detect whether its own model, or the other model, halts.
> >
> > Olcott's method by declaring the procedure as void WillHalt()
> > is of course silly, as the side effect is readily convertible
> > to a state change (or local variable change), which can thence
> > be returned in an int ConvertedWillHalt(). This means his
> > solution buys exactly nothing, in that space.
>
> Try and analyze this all the way. There must be a hidden assumption
> that you are making, but, not stating.
>

Actually, it would be y o u r turn to point it out, since y o u are
doubting that the argument is valid. (With other words, p l e a s e
substantiate your claim!)

If you can't do that you lost.

F.

Relevant Pages

  • Re: Yet another Attempt at Disproving the Halting Problem
    ... > asking thart question, instead asking whether that's what i ... >>I can see this because the halting problem can not be constructed to ... It can't go into any infinte loop, ... This is the same idea as the void WillHalt() function. ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... > asking thart question, instead asking whether that's what i ... >>I can see this because the halting problem can not be constructed to ... It can't go into any infinte loop, ... This is the same idea as the void WillHalt() function. ...
    (sci.logic)
  • Re: Disproof of the Halting Problems Conclusion
    ... >> void WillHalt can be simulated by a Turing Machine, ... >> machine program can solve the halting problem. ... >> the halting problem any better than bool WillHaltcan. ...
    (sci.logic)
  • Re: Disproof of the Halting Problems Conclusion
    ... >> Peter Olcott says... ... >> void WillHalt can be simulated by a Turing Machine, ... >> the halting problem any better than bool WillHaltcan. ...
    (sci.logic)