Re: The proof that I was referring to is on the website

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

Date: Wed, 11 Aug 2004 13:05:13 -0400

Peter Olcott wrote:

> "Simon G Best" <s.g.best@btopenworld.com> wrote in message news:4118D9CA.2080705@btopenworld.com...
>
>>Peter Olcott wrote:
>>[...]
>>
>>Net.kooks often end up resorting to posting things like this:-
>>
>>
>>>ICFANV Incorrect Reasoning based on a False Assumption thatis Never
>>>Validated.
>>
>>Anyway...
>>
>>
>>>The TM that returns its result to write only screen memory [...]
>>
>>isn't a TM. But Peter Olcott wants the Church-Turing Thesis to only cut
>>one way at a time. It cuts both ways.
>>
>>
>>>LoopIfHalts does not "loop if halts" it only loops if you tell it that
>>>it halts. If you don't tell it that it halts, then it does not loop. If you
>>>tell someone else (write only screen memory) and do not tell it, then
>>>it halts. Whenever you tell it that it halts, it loops. So not telling it
>>>and telling someone else, has an entirely different effect than telling
>>>it, and not telling someone else.
>>>
>>>Since its behavior is changed when you tell it that it halts, as compared
>>>to not telling it (and telling the write only screen memory) therefore the
>>>analysis is also changed. Only by returning the result to the program being
>>>analyzed is the Halting Problem indeterminate. If you simply refrain from
>>>telling the program being analyzed any of the results of the analysis, what
>>>was indeterminate becomes determinate.
>>
>>Two problems:-
>>
>>1. You've provided no way for a TM to be able to determine whether or
>>not it was invoked as part of another TM.
>
>
> I will write up the whole new proof, alomng with this key missing
> piece probably tonight. It will be on my website.
> www.halting-problem.com

 From your website:
"The last step is the method by which the Halt function can determine
its calling context. In other words whether or not it was called by
another Turing Machine, or invoked independently of any other Turing
Machine.

This can be a very simple feature that is implemented in the Universal
Turing Machine. The Halt function would merely ask the UTM whether or
not its specifically indicated final state has any state transition
defined. This information is very easy for the UTM to provide, it merely
looks up the action associated with the state in its state transition
matrix table. "

What if Halt is not running on a UTM? 

-- 
Will Twentyman
email: wtwentyman at copper dot net

Relevant Pages

  • Re: The proof that I was referring to is on the website
    ... "The last step is the method by which the Halt function can determine ... another Turing Machine, or invoked independently of any other Turing ... This information is very easy for the UTM to provide, ... looks up the action associated with the state in its state transition ...
    (comp.theory)
  • Re: The proof that I was referring to is on the website
    ... :> The Halt function would merely ask the UTM whether or ... This information is very easy for the UTM to provide, ... There is NO SUCH THING as "a Turing machine that executes in a finite ...
    (sci.logic)
  • Re: The proof that I was referring to is on the website
    ... It will be on my website. ... > another Turing Machine, or invoked independently of any other Turing ... This information is very easy for the UTM to provide, ... > looks up the action associated with the state in its state transition ...
    (comp.theory)
  • Re: The proof that I was referring to is on the website
    ... It will be on my website. ... > another Turing Machine, or invoked independently of any other Turing ... This information is very easy for the UTM to provide, ... > looks up the action associated with the state in its state transition ...
    (sci.logic)
  • Re: The proof that I was referring to is on the website
    ... >>another Turing Machine, or invoked independently of any other Turing ... This information is very easy for the UTM to provide, ... >>looks up the action associated with the state in its state transition ... >>What if Halt is not running on a UTM? ...
    (comp.theory)