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

From: Peter Olcott (olcott_at_worldnet.att.net)
Date: 08/09/04 

Date: Mon, 09 Aug 2004 03:12:30 GMT

">parr(*>" <gniKyruaL@tenretnitb.moc> wrote in message news:cf60i4$mm4$1@sparta.btinternet.com...
> "Peter Olcott" <olcott@worldnet.att.net> wrote in message
> news:GwrRc.187128$OB3.166779@bgtnsc05-news.ops.worldnet.att.net...
> |
> | "Daryl McCullough" <daryl@atc-nycorp.com> wrote in message
> news:cf5crt045m@drn.newsguy.com...
> | > Peter Olcott says...
> | > But a solution to the halting problem is a program that always
> returns
> | > 0 or 1, by definition. If you introduce a third return value,
> then you
> | > aren't solving the halting problem.
> |
> | Wrong. The solution to the Halting Problem ids any method that
> refutes this definition.
> | No program can ever be written to determine whether any arbitrary
> program will halt
> | http://www.nist.gov/dads/HTML/haltingProblem.html
>
> 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.

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

Relevant Pages

  • Re: [PO] Re: Refutation of the Halting Problems Proof (Clarifications Wanted)
    ... > every existing proof of the Undecidability of the Halting Problem. ... "halt analyzer" is a term you need to define, ... TMs don't return results to other TMs. ... "Since returning the result back to the Turing Machine being analyzed is ...
    (comp.theory)
  • Re: [PO] Re: Refutation of the Halting Problems Proof (Clarifications Wanted)
    ... > every existing proof of the Undecidability of the Halting Problem. ... "halt analyzer" is a term you need to define, ... TMs don't return results to other TMs. ... "Since returning the result back to the Turing Machine being analyzed is ...
    (sci.logic)
  • Re: Exploiting limitations of Turing machines in Turing tests?
    ... correctly answer _any_ halting problem question. ... You were proposing that there exists some finite set of special Turing ... able to successfully answer _all_ halting problem questions. ... It's a description of some Turing Machine, and some input, with the simple ...
    (comp.ai.philosophy)
  • Re: [PO] Re: Proving a negative is hard
    ... and for these conventions ... > Turing machines with the standard conventions for input/output ... > he agrees that there is no standard Turing Machine program ... > that solves the halting problem, ...
    (sci.logic)
  • Re: [PO] Re: Proving a negative is hard
    ... and for these conventions ... > Turing machines with the standard conventions for input/output ... > he agrees that there is no standard Turing Machine program ... > that solves the halting problem, ...
    (comp.theory)