Liste des Groupes | Revenir à theory |
On 3/13/2025 4:22 AM, Mikko wrote:I built an aeroplane. After flying three times around the globe, I found out that my aeroplane cannot possibly reach the moon, so I aborted the flight. My conclusion is that any flight to the moon does not terminate. The moon is unreachable. It is irrelevant that other vehicles reached the moon, because they have no pathological relation with the moon.On 2025-03-13 00:36:04 +0000, olcott said:_DDD()
>>>
void DDD()
{
HHH(DDD);
return;
}
>
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
>
When HHH correctly emulates N steps of the
above functions none of them can possibly reach
their own "return" instruction and terminate normally.
Nevertheless, assuming HHH is a decider, Infinite_Loop and Infinite_Recursion
specify a non-terminating behaviour, DDD specifies a terminating behaviour
[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]
What is the sequence of machine language
instructions of DDD emulated by HHH such that DDD
reaches its machine address 00002183?
Les messages affichés proviennent d'usenet.