Liste des Groupes | Revenir à theory |
On 9/3/2024 2:07 AM, Fred. Zwarts wrote:The simulator is not allowed to change the behaviour of the input. Not by using a Root variable, to make the simulated behaviour different, not by assuming that it should simulate as if the abort code was not present, not by skipping the last few instructions of a halting program, not by simulating a hypothetical other program.Op 02.sep.2024 om 23:06 schreef olcott:That is a stupid thing to say, you can see it wasOn 9/2/2024 12:52 PM, Fred. Zwarts wrote:>Op 02.sep.2024 om 18:38 schreef olcott:>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.
Indeed, it should simulate *itself* and not a hypothetical other HHH with different behaviour.
It is emulating the exact same freaking machine code
that the x86utm operating system is emulating.
Even the best simulator will go wrong if it is given the wrong input.
given the correct input.
Les messages affichés proviennent d'usenet.