Re: What is the Result from Invoking this Halt Function?

From: >parr\(*> (gniKyruaL_at_tenretnitb.moc)
Date: 08/09/04 

Date: Mon, 9 Aug 2004 21:27:01 +0000 (UTC)

"Peter Olcott" <olcott@worldnet.att.net> wrote in message
news:yYBRc.188825$OB3.183273@bgtnsc05-news.ops.worldnet.att.net...
|
| ">parr(*>" <gniKyruaL@tenretnitb.moc> wrote in message
news:cf60i4$mm4$1@sparta.btinternet.com...
| > That's not Turing Machine. Go and buy a Turing machine please
and
| > implement the Halting Function. Come back when you've proved it
| > works.
|
| That is an unreasonable request. My only goal is to show that the
| conclusion of the proof that solving the Halting Problem is
impossible,
| is incorrect.

I can't see why it's an unreasonable request.

You have not yet pinpointed the erroneous line(s) in Turing's proof.
Indeed, you have not yet even started to address the theoretical
basis of it.

Yet you assert creation of a halting detector is possible. In that
case build it, test it, and demonstrate it instead of waffling on
endlessly about possible alternatives on non-Turing machines.

But if you insist it's unreasonable, that's your problem not mine.
I'm not the one having problems understanding Turing's proof. 

--
)>==ss$$%PARR(º>   Parr

Relevant Pages

  • Re: What is the Result from Invoking this Halt Function?
    ... Go and buy a Turing machine please ... |> implement the Halting Function. ... I can't see why it's an unreasonable request. ...
    (sci.logic)
  • Re: Disproof of the Halting Problems Conclusion
    ... this would be the same text in which Lintz proves that the Halting ... >> language version of the Halting Problem on which it makes sense to talk ... it does not define what a Turing machine is. ... refer to a string, but then talks about "Turing machine M". ...
    (sci.logic)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... Disproving the Halting Problem ... the only way to construct a halt analyzer, ... another Turing Machine, or invoked independently of any other Turing ...
    (sci.logic)
  • Re: Rados Sigma and the Halting Problem for Programs
    ... AD> computer language that does not contrive a logic paradox ... Halting Theorem may be proven without recourse to reductio ... computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ...
    (sci.math)
  • Re: Rados Sigma and the Halting Problem for Programs
    ... AD> computer language that does not contrive a logic paradox ... Halting Theorem may be proven without recourse to reductio ... computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ...
    (sci.logic)
Loading