Sujet : Re: Hypothetical possibilities --- Correct emulation has been proven for three years
De : noreply (at) *nospam* example.org (joes)
Groupes : comp.theoryDate : 01. Aug 2024, 08:20:38
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <4a0d6c844899ab1354b5f5013e3e8342aa2efb9f@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Wed, 31 Jul 2024 16:23:09 -0500 schrieb olcott:
On 7/31/2024 3:01 PM, Fred. Zwarts wrote:
Op 31.jul.2024 om 17:14 schreef olcott:
On 7/31/2024 3:44 AM, Fred. Zwarts wrote:
Op 31.jul.2024 om 06:09 schreef olcott:
We don't show any of HHH and show the execution trace of of just DDD
assuming that HHH is an x86 emulator.
This assumption is incorrect if it means that HHH is an unconditional
simulator that does not abort.
This algorithm is used by all the simulating termination analyzers:
So, Sipser only agreed to a correct simulation, not with an incorrect
simulation that violates the semantics of the x86 language by skipping
the last few instructions of a halting program.
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
int main()
{
HHH(DD);
}
DD correctly emulated by HHH cannot possibly reach its own second line.
If HHH can't simulate itself, it is not a decider.
-- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:It is not guaranteed that n+1 exists for every n.
…