Re: Yet another Attempt at Disproving the Halting Problem

From: Daryl McCullough (daryl_at_atc-nycorp.com)
Date: 08/13/04 

Date: 12 Aug 2004 19:02:54 -0700

Peter Olcott says...

>> Turing *defined* what he meant by a "solution to the halting problem"
>> and by that definition, there *is* no solution. You are proposing a
>
>Halting Problem according to Alan Turing:
>The problem of finding out whether a given number is the D.N of a
>circle-free machine,
>
>Translation: (The problem of finding out whether a given Turing Machine
>Description specifies a Turing Machine that fails to Halt).
>
>I have refuted any existing proof that the above is impossible.

What you have not refuted (because it is provably true) is this:
There is no program H(x,y) which for any pair of inputs x and y,
*always* returns 1 if x is the code for a computer program of one
argument which halts on input y, and *always* returns 0 otherwise.

That's what Turing proved, and you have said nothing that casts
doubt on that proof. So your 1000 posts on this subject have been
a waste of everyone's time. 

--
Daryl McCullough
Ithaca, NY

Relevant Pages

  • Re: A cake recipe is a computer program
    ... >> computer program or not. ... Now I have seen Neil refer to a recipe so I ... >One may argue about whether or not any particular language is Turing ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... >Translation: (The problem of finding out whether a given Turing Machine ... >Description specifies a Turing Machine that fails to Halt). ... *always* returns 1 if x is the code for a computer program of one ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... >Translation: (The problem of finding out whether a given Turing Machine ... >Description specifies a Turing Machine that fails to Halt). ... *always* returns 1 if x is the code for a computer program of one ...
    (comp.lang.cpp)
  • Re: The Psychology of Responding to Crackpots
    ... > In one sense what Turing stated was mathematically sound. ... > There does exist a computer program that can thwart the ... That has nothing to do with the halting problem, ...
    (sci.logic)
  • Re: proof of undecidability of halting problem
    ... however, the contradiction is introduced by using a second function, ... a function like halt can't? ... Turing proved it could be done. ... How can a high level language prove theorems ...
    (sci.logic)