Re: Defining a correct simulating halt decider

Op 03.esp.2024 OM 01:11 screech Wolcott:

On 9/2/2024 11:38 AM, olcott wrote:

A halt decider is a Turing machine that computes
the mapping from its finite string input to the
behavior that this finite string specifies.
>
If the finite string machine string machine
description specifies that it cannot possibly
reach its own final halt state then this machine
description specifies non-halting behavior.
>
A halt decider never ever computes the mapping
for the computation that itself is contained within.
>
Unless there is a pathological relationship between
the halt decider H and its input D the direct execution
of this input D will always have identical behavior to
D correctly simulated by simulating halt decider H.
>
*Simulating Termination Analyzer H Not Fooled by Pathological Input D*
https://www.researchgate.net/ publication/369971402_Simulating_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D
>
A correct emulation of DDD by HHH only requires that HHH
emulate the instructions of DDD** including when DDD calls
HHH in recursive emulation such that HHH emulates itself
emulating DDD.
>

 ** According to the semantics of the x86 language.
 This prevents the correctly emulated** DDD from ever
reaching its final halt state no matter what HHH does.
 

Exactly! The simulated DDD is prevented to halt by this premature abort.
(It would halt, if not aborted, as seen in the direct execution, in the simulation by the unmodified world class simulator and even by the simulation by HHH1.)
No matter what HHH does, it fails to reach the end of the halting program specified by the finite string. This proves that HHH cannot possibly simulate itself correctly up to the end.