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

From: George Greene (greeneg_at_greeneg-cs.cs.unc.edu)
Date: 08/14/04 

Date: 14 Aug 2004 15:24:10 -0400

"Peter Olcott" <olcott@worldnet.att.net> writes:
 : > 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?

PO:
 : What if its not running at all?

That's OUR point, dumbass! TMs ARE NEVER running!
EVENTS do NOT *happen* in the universe we are talking
about! It DOES NOT HAVE time! EVERYthing just ALWAYS IS
the way it is, at ALL times! It's a completely tenseless universe!

 : As long as I can point out one specific scenario
 : (that can't be made impossible)

Nothing NEEDS to be MADE impossible if it was already impossible
to begin with. And "scenarios" have NOTHING to do with this.

 : that directly refutes the statement below:
 :
 : Definition of the Halting Problem

This is NOT the definition of the halting problem, you ignorant dumbasss.

 : 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

There is NO SUCH THING as "a Turing machine that executes in a finite
number of steps". What executes in a finite number of steps is a
Turing Machine ON SOME INPUT, dumbass. The TM is NOT the ONLY parameter
for the problem: THE INITIAL CONTENTS OF THE INPUT TAPE matters AS WELL.
You can have the SAME Turing Machine giving DIFFERENT behavior on the basis
of DIFFERENT initial contents of its tape! 

-- 
 --- The history of our nation has demonstrated that separate is seldom, if ever, equal.
 --- (Feb.3,2004) Supreme Judicial Court of Massachusetts (4-3), adv.Sen.#2175

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 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: What is the Result from Invoking this Halt Function?
    ... > A halt function that correctly determines whether any element in the ... ;halt analyzer that always returns a correct result back to the program ... ;another Turing Machine, or invoked independently of any other Turing ... This information is very easy for the UTM to provide, ...
    (sci.logic)
  • Re: What is the Result from Invoking this Halt Function?
    ... > A halt function that correctly determines whether any element in the ... ;halt analyzer that always returns a correct result back to the program ... ;another Turing Machine, or invoked independently of any other Turing ... This information is very easy for the UTM to provide, ...
    (comp.theory)
  • Re: The Demise of Computationalism?
    ... One might imagine that there is a Turing Machine infrastructure. ... UTM, without knowing _which_ TM description you will be given on the ... Also I chose this example because I'm interested in randomness. ... some finite string up digits, which passed randomness tests, ...
    (comp.ai.philosophy)