Sujet : Re: DDD correctly emulated by HHH --- Correct Emulation Defined
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 20. Mar 2025, 12:00:23
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <1de7234bcf7e535c57fb0369d16f9a1af3573fa7@i2pn2.org>
References : 1
User-Agent : Mozilla Thunderbird
On 3/19/25 10:32 PM, olcott wrote:
DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
When N steps of DDD are emulated by HHH according
to the semantics of the x86 language then these
N steps are emulated correctly.
Right, The N Steps of DDD were emulated correctly, but not the WHOLE of DDD, that wasn't correctly emulated.
Again, you confuse two different things and call them the same.
By your logic, if you get off a highway at the first exit, and thus can say for certain that it didn't end in that first streach, that the full road which continued on from there, must never end anywhere.
Sorry, you are just proving you know you are committing FRAUD by lying about your definitions.