Sujet : Re: Everyone here seems to consistently lie about this
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 03. Aug 2024, 09:06:17
Autres entêtes
Organisation : -
Message-ID : <v8kodp$3bu46$1@dont-email.me>
References : 1
User-Agent : Unison/2.2
On 2024-08-02 02:09:38 +0000, olcott said:
*This algorithm is used by all the simulating termination analyzers*
<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.
The determination is not correct. DDD is a halting computation, as
correctely determined by HHH1 or simly calling it from main. It is
not possible to correctly determine that ha haling computation is
non-halting, as is self-evdent from the meaning of the words.
-- Mikko