Sujet : Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD)
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theoryDate : 12. May 2025, 05:11:51
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvrse7$sjai$9@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
User-Agent : Mozilla Thunderbird
On 5/11/2025 10:54 PM, dbush wrote:
On 5/11/2025 11:50 PM, olcott wrote:
On 5/11/2025 10:39 PM, dbush wrote:
On 5/11/2025 11:36 PM, olcott wrote:
>
You try to get away with changing the subject
because you know that you are lying about one
or more steps of DDD emulated by HHH according
to the rules of the x86 language
>
It is you who are changing the subject away from DDD emulated by HHH (not one or more steps of DDD emulated by HHH) which you have admitted for the record is not correct:
>
>
I am only referring to the hypothetical infinite
set of pure x86 emulators specified below:
>
Each of which is processing a distinct, different input.
Changing the input is not allowed.
I am examining all the elements of a infinite set
such that each HHH/DDD pair has a specific fixed form.
_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]
For all x86 emulators HHH that emulate 1 or more x86 instructions
of an input there does not exist a DDD (matching the above template)
correctly emulated by HHH such that DDD reaches its “ret” instruction
final halt state.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer