Liste des Groupes | Revenir à theory |
*This algorithm is used by all the simulating termination analyzers*The determination is not correct. DDD is a halting computation, as
<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
If simulating halt decider H correctly simulates its input D
until H correctly determines that its simulated D would never
stop running unless aborted then
H can abort its simulation of D and correctly report that D
specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
DDD is correctly emulated by HHH according to the x86
language semantics of DDD and HHH including when DDD
emulates itself emulating DDD
*UNTIL*
HHH correctly determines that never aborting this
emulation would cause DDD and HHH to endlessly repeat.
Les messages affichés proviennent d'usenet.