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

From: Peter Olcott (olcott_at_worldnet.att.net)
Date: 08/12/04 

Date: Thu, 12 Aug 2004 00:58:03 GMT

"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:

Definition of the Halting Problem
There does not exist a Turing Machine that can correctly determine whether or
not each and every element in the universal set of Turing Machines will execute
in a finite number of steps

Then I have proven what has been throught to be impossible for sixty-eight
years is not impossible at all. I have already done this, twice.

> --
> Will Twentyman
> email: wtwentyman at copper dot net
>

Relevant Pages

  • 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)
  • 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? ...
    (sci.logic)
  • 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 ...
    (sci.logic)
  • 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)