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

From: Will Twentyman (wtwentyman_at_read.my.sig)
Date: 08/13/04 

Date: Thu, 12 Aug 2004 21:58:12 -0400

Peter Olcott wrote:

> "Will Twentyman" <wtwentyman@read.my.sig> wrote in message news:411b91f1_3@newsfeed.slurp.net...
>
>>Peter Olcott wrote:
>>
>>
>>>"Bryan Olson" <fakeaddress@nowhere.org> wrote in message news:EoDSc.3826$hk.3299@newssvr27.news.prodigy.com...
>>>
>>>
>>>>Peter Olcott wrote:
>>>>
>>>>>Quick Summary:
>>>>>Alan Turing conclusively proved is that it is impossible to construct
>>>>>a halt analyzer that always returns a correct result back to the program
>>>>>being analyzed.
>>>>
>>>>Why try to translate the proof into nonsense? Peter, you said
>>>>you would use the proof from your text. The proof shows there
>>>>is no Turing machine that decides halts. On the other hand,
>>>>there is a Turing machine that accepts halts.
>>>
>>>
>>>I am now using Alan Turing's original proof. Any proof that shows there
>>>is no TM that decides Halts has now been correctly refuted by my method.
>>>www.halting-problem.com
>>
>>Your website does not deal with a halting function as defined in
>>anyone's proof.
>>
>>
>>
>>
>>--
>>Will Twentyman
>>email: wtwentyman at copper dot net
>>
>
>
> 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).
>
> The above translation was based on pages 5, 12 and 18 of the following
> http://www.abelard.org/turpap2/tp2-ie.asp
>
> Turing's words continued:
> and we have no general process for doing this in a finite number of steps.
> In fact, by applying the diagonal process argument correctly, we can show
> that there cannot be any such general solution.

Apparently you failed to understand. Any statement of the Halting
Problem allows for two and only two responses from the Halt TM. You
have specified *three* possible responses. A Halt TM cannot refuse to
provide a result and be accurately described as a Halt TM. 

-- 
Will Twentyman
email: wtwentyman at copper dot net

Relevant Pages

  • Re: What is the Result from Invoking this Halt Function?
    ... >>Will Twentyman ... > Halting Problem according to Alan Turing: ... (The problem of finding out whether a given Turing Machine ... Problem allows for two and only two responses from the Halt TM. ...
    (comp.theory)
  • Re: What is the Result from Invoking this Halt Function?
    ... : Translation: (The problem of finding out whether a given Turing Machine ... Description specifies a Turing Machine that fails to Halt). ... What is relevant is that the original proof is ABOUT TURING MACHINES, ... and about whether THEY halt or THEY can determine halting. ...
    (sci.logic)
  • Re: Alan Turings Halting Problem is Incorrect (FINAL PART)
    ... "Turing machines sometimes halt, and sometimes they enter an infinite ... The halting problem asks: ... Turing machine and its input and determine whether the machine will ...
    (sci.logic)
  • Re: On The Proper Formulation Of The Halting Problem
    ... >> formulation of the Halting Problem is more or less along ... >> will halt, wwill loop, and vice versa. ...
    (sci.logic)
  • Re: PROOF that numbers are countable
    ... you're the one claiming such an enumeration of halting ... > halt, feel free. ... > If it is as powerful as TMs, then there are constructs that do not halt. ... > claim applies to your special selection, ...
    (comp.theory)