XPost: comp.theory, sci.logic   
   From: polcott333@gmail.com   
      
   On 6/13/2024 8:24 PM, Richard Damon wrote:   
    > On 6/13/24 11:32 AM, olcott wrote:   
    >>   
    >> It is contingent upon you to show the exact steps of how H computes   
    >> the mapping from the x86 machine language finite string input to   
    >> H(D,D) using the finite string transformation rules specified by   
    >> the semantics of the x86 programming language that reaches the   
    >> behavior of the directly executed D(D)   
    >>   
    >   
    > Why? I don't claim it can.   
      
   The first six steps of this mapping are when instructions   
   at the machine address range of [00000cfc] to [00000d06]   
   are simulated/executed.   
      
   After that the behavior of D correctly simulated by H diverges   
   from the behavior of D(D) because the call to H(D,D) by D   
   correctly simulated by H cannot possibly return to D.   
      
   _D()   
   [00000cfc](01) 55          push ebp   
   [00000cfd](02) 8bec        mov ebp,esp   
   [00000cff](03) 8b4508      mov eax,[ebp+08]   
   [00000d02](01) 50          push eax       ; push D   
   [00000d03](03) 8b4d08      mov ecx,[ebp+08]   
   [00000d06](01) 51          push ecx       ; push D   
   [00000d07](05) e800feffff  call 00000b0c  ; call H   
   [00000d0c](03) 83c408      add esp,+08   
   [00000d0f](02) 85c0        test eax,eax   
   [00000d11](02) 7404        jz 00000d17   
   [00000d13](02) 33c0        xor eax,eax   
   [00000d15](02) eb05        jmp 00000d1c   
   [00000d17](05) b801000000  mov eax,00000001   
   [00000d1c](01) 5d          pop ebp   
   [00000d1d](01) c3          ret   
   Size in bytes:(0034) [00000d1d]   
      
   --   
   Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius   
   hits a target no one else can see." Arthur Schopenhauer   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)