Re: Can the 'Turing Problem' be deflated?

On Apr 2, 5:25 pm, J Jones <jonescard...@xxxxxxx> wrote:
In any event, a determination of a 'halt' is the recognition of a
fulfillment of a command.

No, it isn't.

Please.
Please stop pretending that you know what you are talking about.
TMs are SYMBOLIC. They are ABSTRACT. They do NOT
INVOLVE "recognition" and "fulfillment". They just statically
ARE what they are, all the time, LIKE THE LETTER 'a'.
A TM program is like a string or sentence of letters.
It has a structure just as surely as a sentence has words.
But it does not *really* involve anything or anybody DOING
anything, whether halting or anything else. It just lies there.
It just *is*. It's about BEING, AND NOT doing, DESPITE the
metaphorical language. While the program is actually being
executed on some hardware, you can talk about doing.
But the source CODE, the PROGRAM, is just a thing that
*is* as *opposed* to "does". And a TM is its PROGRAM, NOT
any physical machine that does something.

There are many many DIFFERENT ways of specifying or
encoding the program.

The stuff I said above is stuff you NEED to just BELIEVE.
You need to just TAKE MY WORD for it. You DON'T get
to have your own special super-insightful perspective.
You START by agreeing with THAT and THEN we can disagree
about complexities that follow FROM that. But we *must start*
from the *same* axioms.


.

Relevant Pages

  • Re: Can the Turing Problem be deflated?
    ... a fulfillment of a command. ... WE TELL YOU what "halt" means. ... radiation oncologist who had studied the hard details of the ...
    (sci.logic)
  • Re: Can the Turing Problem be deflated?
    ... command has been made by the machine without our knowing it. ... fulfillment criteria, except those criteria given by the machine. ... in turn means that we cannot tell whether the Turing machine will halt ... HALT command is immaterial - which is true. ...
    (sci.logic)
  • Can the Turing Problem be deflated?
    ... This anthropomorphism allows Turing to claim that we cannot discern if a command has been made by the machine without our knowing it. ... This in turn means that we cannot tell whether the Turing machine will halt or not. ... Each step that the machine takes can be viewed as picking up a command and fulfilling it, or starting and halting. ... We cannot avoid the machine's limitation in being unable to show us the fulfillment of a command by commanding or programming the Turing machine to, as it were, 'switch off all the lights when you're done'; for we still need to know when to instruct the machine to 'turn off the lights'. ...
    (sci.logic)
  • Re: Can the Turing Problem be deflated?
    ... 'Halting' traditionally means that the machine ... command has been made by the machine without our knowing it. ... fulfillment criteria, except those criteria given by the machine. ... in turn means that we cannot tell whether the Turing machine will halt ...
    (sci.logic)
  • Re: Mr.Smith , i need help
    ... but you sound more like someone pretending to not have a good command of ... English than someone who actually stumbles over the language ...
    (microsoft.public.word.vba.beginners)