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

On 11/05/2025 16:26, olcott wrote:

On 5/11/2025 7:26 AM, Alan Mackenzie wrote:

<snip>

If you still think you are correct, and cannot point out a flaw in Alan
Turing's original 1936 paper, perhaps you can find somebody qualified,
i.e. with (at least) a first degree in mathematics, to back up your
claim.
>

 The flaw is that the conclusion is incorrect.

You have not shown this.

One can ignore every step in a proof and show
that it is wrong by simply proving that its
conclusion is incorrect.

The very best way to prove that the conclusion is incorrect is to produce a program that can in finite time correctly answer HALTS or LOOPS for any arbitrary (syntactically correct) program (in a Turing-complete language) and arbitrary data.
Do that, and you shall have not just your Turing Award but also, if you play your cards right, a Fields Medal into the bargain.
But your on-paper proof is almost as full of holes as your C code, so you've got your work cut out.
<snip>

The same thing applies to the Halting Problem's
counter example input:

...which didn't actually compile here, presumably because it was written by someone who doesn't know C very well.
When you get to grips with your universal solver, you might want to phone a friend to do the coding for you.
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within