Re: Can the 'Turing Problem' be deflated?

From: J Jones <jonescardiff@xxxxxxx>
Date: Wed, 02 Apr 2008 22:25:40 +0100

george wrote:

On Mar 31, 6:27 pm, J Jones <jonescard...@xxxxxxx> wrote:
'Halt' is the recognition of
a fulfillment of a command.

WHY do you think YOU get to SAY what "halt" is or means???
WE *ALREADY HAVE DEFINITIONS* FOR ALL OUR TERMS!

You do NOT GET to tell US what "halt" means.
WE TELL YOU what "halt" means.

In any event, a determination of a 'halt' is the recognition of a fulfillment of a command. Please.
.

Follow-Ups:
- Re: Can the 'Turing Problem' be deflated?
  - From: george
- Re: Can the 'Turing Problem' be deflated?
  - From: Marshall

References:
- Re: Can the 'Turing Problem' be deflated?
  - From: george
- Re: Can the 'Turing Problem' be deflated?
  - From: J Jones
- Re: Can the 'Turing Problem' be deflated?
  - From: george

Prev by Date: TIME DEGRADATION
Next by Date: Re: Question regarding incompleteness in formal systems without sufficient power for arithmetic.
Previous by thread: Re: Can the 'Turing Problem' be deflated?
Next by thread: Re: Can the 'Turing Problem' be deflated?
Index(es):
- Date
- Thread

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?
... Marshall wrote: ... a fulfillment of a command. ... You do NOT GET to tell US what "halt" means. ...
(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?
... fulfillment of a command. ... Please stop pretending that you know what you are talking about. ... TMs are SYMBOLIC. ...
(sci.logic)