Re: Hypothetical possibilities --- Correct emulation has been proven for three years

On 8/1/2024 2:20 AM, joes wrote:

Am Wed, 31 Jul 2024 16:23:09 -0500 schrieb olcott:

On 7/31/2024 3:01 PM, Fred. Zwarts wrote:

Op 31.jul.2024 om 17:14 schreef olcott:

On 7/31/2024 3:44 AM, Fred. Zwarts wrote:

Op 31.jul.2024 om 06:09 schreef olcott:

 

We don't show any of HHH and show the execution trace of of just DDD
assuming that HHH is an x86 emulator.

This assumption is incorrect if it means that HHH is an unconditional
simulator that does not abort.

This algorithm is used by all the simulating termination analyzers:

 

So, Sipser only agreed to a correct simulation, not with an incorrect
simulation that violates the semantics of the x86 language by skipping
the last few instructions of a halting program.
>

int DD()
{
    int Halt_Status = HHH(DD);
    if (Halt_Status)
      HERE: goto HERE;
    return Halt_Status;
}
int main()
{
    HHH(DD);
}
DD correctly emulated by HHH cannot possibly reach its own second line.

If HHH can't simulate itself, it is not a decider.
 

So we are back to your lack of software engineering skill.
You cannot see that the second instruction of DD correctly*
emulated by HHH cannot possibly be reached by DD. This
remains true no matter how many levels that HHH emulates
itself emulating DD.
*According to the x86 semantics of DD and HHH
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer