Liste des Groupes | Revenir à theory |
On 3/20/25 6:43 PM, olcott wrote:We have been over this same thing too many times.On 3/20/2025 4:16 AM, Mikko wrote:Then HHH isn't a specific program, and you are admitting that you "logic" is just based on FRAUD.On 2025-03-20 02:32:43 +0000, olcott said:>
>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.
That does not make much sense to define the correct emulation of DDD as
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.
>
N in this context always means any element of the
set of natural numbers.
The point remains the same without the additional details.>DIFFERENT HHHs and thus DIFFERENT DDDs were emulated.
1,2,3...4,294,967,296 steps of DDD are correctly emulated
by HHH and DDD never reaches its "ret" instruction and
terminates normally.
Same finite string at the same machine address 00002172.>Right, and every one of them creates an input DDD,The term should be or include "partial emulation" when the intent is>
that an emulation that could be continued is not is called "correct".
>
A finite number of N steps means a finite emulation.
>
that when COMPLETELY emulated halts,You already said that DDD emulated by HHH never reaches
and thus should be called a halting input in any HONEST logic system.WHY LIE ABOUT THIS NOW?
Of course, in your FRAUD, you claim otherwise, but that just shows how bad your FRAUDULANT system is,--
Les messages affichés proviennent d'usenet.