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

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

Date: Wed, 11 Aug 2004 21:52:16 -0400

Peter Olcott wrote:

> "Will Twentyman" <wtwentyman@read.my.sig> wrote in message news:411a508b$1_1@newsfeed.slurp.net...
>
>>Peter Olcott wrote:
>
>
>>>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?
>
>
> What if its not running at all?
> As long as I can point out one specific scenario (that can't be made impossible)
> that directly refutes the statement below:

You missed the point of the question. You want Halt to ask the UTM it's
running on a question. You are *assuming* it is running on a UTM, and
that the ability to query the UTM is even possible/meaningful. 

-- 
Will Twentyman
email: wtwentyman at copper dot net

Relevant Pages

  • Re: What is the Result from Invoking this Halt Function?
    ... I must have the UTM tell me that it has no other ... its own tape and state transition matrix to directly execute any other ... That there is no UTM state transition out of the halt analyzer's final state ... (the one that write the ONE to the tape). ...
    (comp.theory)
  • Re: What is the Result from Invoking this Halt Function?
    ... I must have the UTM tell me that it has no other ... its own tape and state transition matrix to directly execute any other ... That there is no UTM state transition out of the halt analyzer's final state ... (the one that write the ONE to the tape). ...
    (sci.logic)
  • Re: What is the Result from Invoking this Halt Function?
    ... I must have the UTM tell me that it has no other ... > its own tape and state transition matrix to directly execute any other ... > That there is no UTM state transition out of the halt analyzer's final state ... > (the one that write the ONE to the tape). ...
    (comp.theory)
  • Re: What is the Result from Invoking this Halt Function?
    ... I must have the UTM tell me that it has no other ... > its own tape and state transition matrix to directly execute any other ... > That there is no UTM state transition out of the halt analyzer's final state ... > (the one that write the ONE to the tape). ...
    (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)
Loading