Liste des Groupes | Revenir à theory |
*The best selling author of theory of computation textbooks*No, that definition does not apply to Sipser's words. There a "correct
<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>
Correct simulation is defined as D is emulated by H according to
the semantics of the x86 language thus includes H emulating itself
emulating D.
Les messages affichés proviennent d'usenet.