Liste des Groupes | Revenir à theory |
On 3/21/2025 2:59 AM, Mikko wrote:OP does not say so. Elsewhere you have said that HHH is the program atOn 2025-03-20 22:43:34 +0000, olcott said:This HHH is the hypothetical HHH the emulates an arbitrary number
On 3/20/2025 4:16 AM, Mikko wrote:No, it does not. It means a number that makes sense in the context andOn 2025-03-20 02:32:43 +0000, olcott said:N in this context always means any element of the
DDD()That does not make much sense to define the correct emulation of DDD as
[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.
it should mean whatever "correct emulation" means when applied to DDD.
Althouth promised otherwise on the subject line the meaning of "DDD
correctly emulated by HHH" when N is not specified is not defined.
set of natural numbers.
will be specified when the definition shall be applied.
1,2,3...4,294,967,296 steps of DDD are correctly emulatedBut your HHH does not simulate correctly more steps of DDD than your
by HHH and DDD never reaches its "ret" instruction and
terminates normally.
HHH1 does.
of steps of DDD according to the semantics of the x86 language.
It is always at machine address 000015d2. This same HHH also
has the ability to emulate itself emulating DDD.
Les messages affichés proviennent d'usenet.