Re: The proof that I was referring to is on the website
From: George Greene (greeneg_at_greeneg-cs.cs.unc.edu)
Date: 08/11/04
- Next message: George Greene: "Re: The proof that I was referring to is on the website"
- Previous message: Chris Menzel: "Re: What is the Result from Invoking this Halt Function?"
- In reply to: Will Twentyman: "Re: The proof that I was referring to is on the website"
- Next in thread: George Greene: "Re: The proof that I was referring to is on the website"
- Messages sorted by: [ date ] [ thread ]
Date: 11 Aug 2004 13:52:40 -0400
Peter Olcott wrote:
: "The last step is the method by which the Halt function can
: determine its calling context.
In the context of TMs generally, there simply is no such method,
nor would it matter if there were, because in the TM context,
there is no such thing as "calling". There is never any NEED
for any TM to "call" any other TM, in the context of the argument
that WE are having, because WE are talking about the space of
ALL possible TMs. If TM M can accomplish something by calling
TM P, then there MUST EXIST ANOTHER TM, call it N, which looks
just like M, except that where M calls P, N JUST INCLUDES THE
SOURCE CODE OF P, textually, word-for-word. It just has ANOTHER
COPY of P -- WITH all the right parameters pre-substituted, if P
had parameters. THAT TM must do the SAME thing and produce the
SAME results that M did. So the mere POSSIBILITY of anything
calling anything else is simply completely irrelevant.
: In other words whether or not it was
: called by another Turing Machine, or invoked independently of any
: other Turing Machine.
That can't matter. If it matters then you are not using TMs.
: This can be a very simple feature that is implemented in the
: Universal Turing Machine.
No, really, it can't be.
: 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. "
Another stupid assumption. TMs DO NOT HAVE access to their own
"state transition matrix table". How many of the programs that you,
Peter Olcott, have EVER written, could, in response to user input,
type out THEIR OWN SOURCE CODE? NONE of them, actually.
Dumbass.
-- --- 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
- Next message: George Greene: "Re: The proof that I was referring to is on the website"
- Previous message: Chris Menzel: "Re: What is the Result from Invoking this Halt Function?"
- In reply to: Will Twentyman: "Re: The proof that I was referring to is on the website"
- Next in thread: George Greene: "Re: The proof that I was referring to is on the website"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
