Liste des Groupes | Revenir à s logic |
On 6/22/2024 7:14 PM, Richard Damon wrote:Except it is proven to not be the infinite recursion behavior if H0 is a decider.On 6/22/24 8:01 PM, olcott wrote:That you are too stupid to see an infinite recursion behavior>>
When we stipulate that the only measure of a correct emulation
is the semantics of the x86 programming language then we see
that when DDD is correctly emulated by H0 that its call to
H0(DDD) cannot possibly return.
Right, so what do you do when you run out of instructions to simulate?
>
Your logic just BLOWS UP.
>
pattern does not mean that I am not correct.
>>
_DDD()
[00002172] 55 push ebp ; housekeeping
[00002173] 8bec mov ebp,esp ; housekeeping
[00002175] 6872210000 push 00002172 ; push DDD
[0000217a] e853f4ffff call 000015d2 ; call H0(DDD)
[0000217f] 83c404 add esp,+04
[00002182] 5d pop ebp
[00002183] c3 ret
Size in bytes:(0018) [00002183]
>
>
This exposes the LIE of your system. YOu CAN'T correctly x86 emulate a partial program, becuase it isn't prpgram with behavior to emulate.
>
PERIOD.
>
That means, the call to H0(DDD), to have any actual meaning, must incluede *ALL* the instrutions in memory that are going to be used as part of the input, and thus, DDD is TIED to the H0 that we started with, so your "trick" of changing it is shows to just be a LIE.
>
>
You just don't understand that behavior is determined of an SPECIFIC program, a specific instance of the template AFTER pairing it with the decider it is to foil, and when you ask about other deciders looking at THIS input, the input can't change.
>
There goes your two decades down the drain.
Les messages affichés proviennent d'usenet.