Sujet : Re: HHH(DDD) is correct to reject its input as non-halting --- EVIDENCE THAT I AM CORRECT
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 21. Jun 2025, 01:13:20
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <c26ffae53a9518cfe08b7a2083cd75e4c99eac55@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13
User-Agent : Mozilla Thunderbird
On 6/20/25 1:09 PM, olcott wrote:
On 6/20/2025 10:27 AM, joes wrote:
Am Fri, 20 Jun 2025 09:53:41 -0500 schrieb olcott:
On 6/20/2025 4:42 AM, Fred. Zwarts wrote:
Op 19.jun.2025 om 17:23 schreef olcott:
On 6/19/2025 3:55 AM, Fred. Zwarts wrote:
Op 18.jun.2025 om 17:41 schreef olcott:
On 6/18/2025 4:36 AM, Fred. Zwarts wrote:
Op 17.jun.2025 om 16:36 schreef olcott:
>
Indeed, HHH fails to reach the end of the simulation, even though
the end is only one cycle further from the point where it gave up
the simulation.
>
That is counter-factual and over-your-head.
It was an agreement.
>
No evidence presented for this claim. Dreaming again?
Even a beginner understands that when HHH has code to abort and halt,
the simulated HHH runs one cycle behind the simulating HHH, so that
when the simulating HHH aborts, the simulated HHH is only one cycle
away from the same point.
>
Proving that you do not understand what unreachable code is.
>
Even a beginner understands that when HHH has code to abort and halt,
the simulated HHH runs one cycle behind the simulating HHH, so that
when the simulating HHH aborts, the simulated HHH is only one cycle
away from the same point.
Yes this is factual.
Lol, that was the same paragraph.
>
Every simulated HHH remains one cycle behind its simulator no matter how
deep the recursive simulations go. This means that the outermost
directly executed HHH reaches its abort criteria first.
Yes, no simulator can proceed past a call to itself.
>
That is counter-factual and it you knew c well
enough you could verify that is counter-factual.
https://github.com/plolcott/x86utm/blob/master/Halt7.c
Which shows that HHH never correctly simulates its input, as it always will abort its simulation, and a partial simulation is never a correct simulation by the term-of-art definition.
This means that none of simulated HHH have reached their abort criteria.
This means that their own abort code is unreachable at the point where
the outermost HHH would abort.
Or rather, it hasn't been reached yet.
void Infinite_Loop()
{
HERE: goto HERE;
return;
}
Like Infinite_Loop() has not reached its "return" statement yet.
So?
Just because your decider fails on an input that it could have been correct on doesn't make its other errors right.
Just shows that you are too stupid to understand how to actually solve teh problem (for the cases that can be solved)
It is already unreachable *for HHH*
when it starts simulating. It is not unreachable when DDD is run directly,
or simulated by anything else that simulates the one cycle more until
the next inner HHH aborts, so clearly HHH is faulty.
>
The failure to reach that point of the simulation is a property of the
simulator, not of the program specified in the input.
This.
>