Re: H(D,D) cannot even be asked about the behavior of D(D) V2 ---ignoring all other replies

On 6/15/24 11:54 AM, olcott wrote:

On 6/15/2024 10:12 AM, Richard Damon wrote:

On 6/15/24 11:07 AM, olcott wrote:

On 6/15/2024 10:00 AM, Richard Damon wrote:

On 6/15/24 10:37 AM, olcott wrote:

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.
>

>
We must fully resolve this point before proceeding on any other
halting problem points. If the reason that you don't answer is
that this is simply over-your-head then it may not make sense to
continue talking about these things with you.
>
This is the key point that you must understand otherwise our
conversation hit the brick wall of your persistently maintained
ignorance.
>
If there is no mapping from the input to H(D,D) to the behavior
of D(D) then *H IS NOT BEING ASKED ABOUT THIS BEHAVIOR*
>
>

>
You just seem to be stuck in your lies.
>
There *IS* a mapping from the input to H(D,D) to the behavior of D(D),

>
*Then do as I originally requested and provide ALL OF THE STEPS*
*ANYTHING AND EVERYTHING BESIDES ALL OF THE STEPS WILL BE REJECTED*
*OUT-OF-HAND AS WRONG ANSWER*

>
Mappings don't HAVE steps.
>
The mapping, for this H and D, is:
>
(D,D) -> 1
>

 *Wrong mapping*
I am not asking for a mapping from the input to H(D,D)
to a possible output from H(D,D).

So, are you admitting you are just giving up? Or you don't want shown the answer that proves you wrong?

 I am asking for a mapping from the machine language finite
string of the input to H(D,D) to each of the individual steps
of the behavior of D(D).

Why?
That isn't the "mapping" that defines what H is supposed to answer with, and isn't what would normally be called a "mapping" at all.
That would just be the steps of simulaton.
I guess you are just trying again to be deceitful by changing your definitions, just showing how your "native tounge" is lies.

 The first six steps of the mapping from the input to H(D,D)
and the behavior of D(D) are the execution/simulation of
the machine code at address range [00000cfc] to [00000d06].

So? And to be a "correct simulation" by your definitions, it must then simulate the Call H instruction, and then the instructions of H never to retutn to D again, unless it reaches the point where H return the value 0, which appears to be impossible to get to.

 _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]