Re: Computable Functions --- finite string transformation rules

Op 26.apr.2025 om 19:28 schreef olcott:

On 4/26/2025 3:58 AM, Fred. Zwarts wrote:

Op 25.apr.2025 om 23:21 schreef olcott:

On 4/25/2025 8:56 AM, joes wrote:

Am Thu, 24 Apr 2025 19:03:34 -0500 schrieb olcott:

>
Mathematical induction proves that DD emulated by HHH cannot possibly
reach its own final state in an infinite number of steps and it does
this with one recursive emulation.
There is a repeating pattern that every C programmer can see.

>

Like Fred wrote months ago, that has nothing to do with the contradictory
part of DD,

>
Sure it does. The contradictory part of DD has always
been unreachable thus only a ruse.
>

only with it being simulated by the same simulator it calls.

>
That <is> the Halting Problem counter-example input.
>

The program EE(){ HHH(EE); } also halts and cannot be simulated by HHH.
>

>
HHH cannot possibly do this without violating the rules of
the x86 language.

HHH already violates the rules of the x86 language by prematurely aborting the halting program.

 Everyone claims that HHH violates the rules
of the x86 language yet no one can point out
which rules are violated

It has been pointed out many times. It is against the rules of the x86 language to abort a halting function. We see that simulators that do not abort have no problem to reach the end of this halting program.
Why do you ignore this? Is that because you already know that HHH does violate the rules and you are only playing trollish head games.