From Newsgroup: comp.lang.c

On 10/28/2025 2:29 PM, joes wrote:

Am Tue, 28 Oct 2025 11:26:44 -0500 schrieb olcott:

On 10/28/2025 10:33 AM, joes wrote:

Am Tue, 28 Oct 2025 09:35:40 -0500 schrieb olcott:

On 10/28/2025 3:34 AM, joes wrote:

Am Tue, 21 Oct 2025 18:54:33 -0500 schrieb olcott:

That DD() halts depends on HHH(DD) rejecting its input.

Which it does, therefore DD halts.

D simulated by H cannot possibly reach past its first line.

It totally can if you

iff (if and only if) you utterly deny reality.

actually mean the program that calls H which aborts instead of the
incomplete diagonal template.

DD does not return because HHH does not abort?

H simulates D that calls H(D) to simulate D that calls H(D) to
simulate D that calls H(D) to simulate D that calls H(D) to simulate D >>>> that calls H(D) to simulate D until H sees this repeating pattern.

Which already happens after two recursive simulations.

Not in the above H(D). You are thinking about HHH(DD).

What does H do differently?

int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}

H simulates D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
until H sees this repeating pattern.

When simulating halt decider H is reporting on the
behavior that its input specifies then H is correct
to reject D as non-halting.

Deciders only compute a mapping from their actual
inputs. Computing the mapping from non-inputs is
outside of the scope of Turing machines.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
--- Synchronet 3.21a-Linux NewsLink 1.2