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

From: Peter Olcott (olcott_at_att.net)
Date: 07/15/04 

Date: Thu, 15 Jul 2004 00:42:18 GMT

> But you haven't refuted the Halting Problem proof, since the problem
> specifically asks if there is a Turing machine that can do it.

I am only using this National Institutes of Standards and Technology
definition of the Halting Problem.

http://www.nist.gov/dads/HTML/haltingProblem.html

> >
> >A fellow programmer where I work said that he thought that
> >I could win the Turing prize for this. Wouldn't that be ironic?
> >
>
> Not likely, as we already have things (in mathematics) that aren't
> Turing machines that can answer the Halting problem for Turing
> machines.
>
> Martin

Please provide a concrete example.

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, ...
    (comp.theory)
  • 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)