Liste des Groupes | Revenir à theory |
On 7/15/2024 3:17 AM, Mikko wrote:HHH does not see even that. It only sees whther that it does not emulateOn 2024-07-14 14:50:47 +0000, olcott said:We don't care about whether HHH halts. We know that
On 7/14/2024 5:09 AM, Mikko wrote:If the function called by DDD is not part of the input then the input doesOn 2024-07-12 14:56:05 +0000, olcott said:DDD is the exact same fixed constant finite string that
We stipulate that the only measure of a correct emulation is theYou should use the indices here, too, e.g., "where 1 to infinity steps of
semantics of the x86 programming language.
_DDD()
[00002163] 55 push ebp ; housekeeping
[00002164] 8bec mov ebp,esp ; housekeeping
[00002166] 6863210000 push 00002163 ; push DDD
[0000216b] e853f4ffff call 000015c3 ; call HHH(DDD)
[00002170] 83c404 add esp,+04
[00002173] 5d pop ebp
[00002174] c3 ret
Size in bytes:(0018) [00002174]
When N steps of DDD are emulated by HHH according to the
semantics of the x86 language then N steps are emulated correctly.
When we examine the infinite set of every HHH/DDD pair such that:
HHH₁ one step of DDD is correctly emulated by HHH.
HHH₂ two steps of DDD are correctly emulated by HHH.
HHH₃ three steps of DDD are correctly emulated by HHH.
...
HHH∞ The emulation of DDD by HHH never stops running.
The above specifies the infinite set of every HHH/DDD pair
where 1 to infinity steps of DDD are correctly emulated by HHH.
DDD₁ are correctly emulated by HHH₃" or whatever you mean.
always calls HHH at the same fixed constant machine
address.
not specify a behaviour and the question whether DDD halts is ill-posed.
HHH halts or fails to meet its design spec.
We are only seeing if DDD correctly emulated by HHH
can can possibly reach its own final state.
Les messages affichés proviennent d'usenet.