Re: 197 page execution trace of DDD correctly simulated by HHH

Op 01.jul.2024 om 20:29 schreef olcott:

On 7/1/2024 1:14 PM, Fred. Zwarts wrote:

Op 01.jul.2024 om 17:56 schreef olcott:

On 7/1/2024 10:52 AM, joes wrote:

Am Mon, 01 Jul 2024 09:35:54 -0500 schrieb olcott:

On 7/1/2024 9:27 AM, Fred. Zwarts wrote:

Op 01.jul.2024 om 14:57 schreef olcott:

On 7/1/2024 3:27 AM, Fred. Zwarts wrote:

Op 30.jun.2024 om 19:25 schreef olcott:

On 6/30/2024 3:42 AM, joes wrote:

>

Unless the outer HHH aborts its simulation after some fixed number of
correct emulations or none of the HHH ever aborts and HHH never stops
running.

But that does not make the result of the abort correct.
Not aborting will loop infinitely.

      If simulating halt decider H correctly simulates its input D until
      H correctly determines that its simulated D would never stop
      running unless aborted

If. D does stop running though, because the H that it calls aborts the
recursive emulation in order to be a decider.
>

>
*In each of the following cases the abort criteria has been met*

>
Again a claim without evidence.
If true, the abort criteria are incorrect.

 The #1 best selling author of theory of computation textbooks is wrong?
The #1 best selling author of theory of computation textbooks is wrong?
The #1 best selling author of theory of computation textbooks is wrong?

No, *you* are wrong because you cite Sipser talking about a correct simulation, whereas your simulation is incorrect, so his words do not apply here. This has been pointed out already many times to you. You seem to be a slow learner.

 https://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/113318779X/
 <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
     If simulating halt decider H correctly simulates its input D
     until H correctly determines that its simulated D would never
     stop running unless aborted then
      H can abort its simulation of D and correctly report that D
     specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
  So you don't even know what an infinite loop is?

I do, but since you think that two equals infinite, it is clear that you do not understand it.
HHH simulates only two cycles. Two does not equal infinite.
This has been pointed out to you many times, as well.
You seem to be a slow learner, forgetting many verified facts.
void Finite_Recursion (int N) {
   if (N != 0) Finite_Recursion (N - 1);
}
This is equivalent to you HHH that simulates N cycles.
No abort needed.
But you keep saying that it is an infinite loop.