Re: Can D correctly simulated by H reach its own line 06 and halt?

Sam <sam@email-scan.com> writes:

olcott writes:
>

It is essentially trivial to see that D correctly simulated by H
cannot possibly reach its own final state at line 06 because
D correctly simulated by H remains stuck in recursive simulation.
>
This provides the basis for simulating termination analyzer H to
correctly determine that the halting problem's counter-example
input D cannot possibly halt.

>
Negative.  It is trivial to see that the above code does not
execute, and, as  such, any claims about what it does or does not
do are void, by default.

>
Oh I forgot to endlessly repeat that that the above is
a code template such that every H/D pair of the infinite
set of H/D pairs is only required to correctly simulate
N steps of D using an x86 emulator.

>
Just like any endlessly repeating infinite loop, you're stuck and
will never finish your task.

olcott is playing a kind of practical joke, testing to see
how long it takes people to realize his personal Turing
machine doesn't halt.