Re: Can the 'Turing Problem' be deflated?

On Mar 31, 6:05 pm, J Jones <jonescard...@xxxxxxx> wrote:
Jesse F. Hughes wrote:
J Jones <jonescard...@xxxxxxx> writes:

"The TM either halts or does not engage in copulation."
I propose instead that the Halting Problem
(e) is dissolved. A 'dissolution' might be of what I think Conant calls
"mere nonsense" .

Actually, Turing merely proves that his specs are inconsistent so the
programmer can't implement them. Most theorems have their place in
programming jobs. For example, incompleteness in a logic means that a
report is missing a value from a list. Then the real result is a
theorem something along the lines: "If you don't test out the code
then eventually the program will bomb out."

Turing's spec is inconsistent on the question of whether the program
that takes its input and if it halts on itself then loop, and
otherwise halt, halts on itself or not.

It's as if the user said, "All employees are people and all people
have to have a social security number and some employees don't have a
social security number (the field isn't required.)"

Users always have that problem. The real soultion to the Halting
Problem:

1. Better documentation.
2. New user training.
3. Hire more consultants.

C-B

- Show quoted text -
.

Relevant Pages
Loading