Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)

Am Sat, 10 May 2025 15:42:13 -0500 schrieb olcott:

On 5/10/2025 3:22 PM, Alan Mackenzie wrote:

OK, then, give the page and line numbers from Turing's 1936 paper where
this alleged mistake was made.  I would be surprised indeed if you'd
even looked at Turing's paper, far less understood it.  Yet you're
ready to denigrate his work.
Perhaps it is time for you to withdraw these uncalled for insinuations.
 

It is the whole gist of the entire idea of the halting problem proof
that is wrongheaded.
(1) It is anchored in the false assumption that an input to a
termination analyzer can actually do this opposite of whatever value
that this analyzer returns. No one ever notices that this "do the
opposite" code is unreachable.

The simulated DDD doesn't matter. HHH returns to DDD, and DDD then does
the opposite.

(2) It expects a self-contradictory (thus incorrect)
question to have a correct answer.

Whether a program halts is not contradictory.

Can Carol correctly answer “no” to this (yes/no) question?
When the context of who is asked is understood to be an aspect of the
full meaning of the question then the question posed to Carol is
incorrect because both yes and no are the wrong answer.

Yes, HHH cannot answer correctly.

--
Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
It is not guaranteed that n+1 exists for every n.