Sujet : Re: Philosophy of Computation: Three seem to agree how emulating termination analyzers are supposed to work
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 11. Nov 2024, 10:42:38
Autres entêtes
Organisation : -
Message-ID : <vgsjie$u0to$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2024-11-10 19:28:28 +0000, olcott said:
*The best selling author of theory of computation textbooks*
<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.
No, that definition does not apply to Sipser's words. There a "correct
simulation" measn a simulation that Sipser regards as correct, which
probably is the same as what "coreect simulation" means in Common
Language.
-- Mikko
…