Re: H(D,D) cannot even be asked about the behavior of D(D) V2

On 6/15/24 9:32 AM, olcott wrote:

On 6/15/2024 5:56 AM, Richard Damon wrote:

On 6/14/24 11:53 PM, olcott wrote:

On 6/14/2024 10:40 PM, Richard Damon wrote:

On 6/14/24 11:07 PM, 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.
>
_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]
>
If there is no mapping from the input to H(D,D) to the behavior
of D(D) then H is not even being asked about the behavior of D(D).
H has no obligation to answer questions *THAT IT IS NOT BEING ASKED*
>

>
You keep on stating that LIE.
>

>
That is is over-your-head does not even make it untrue.
That you call me a liar makes you a liar.

>
But it is the TURTH, it IS the MAPPING that H is REQURED to give if it is to be a correct Halt Decider.
>

If you want to claim that I am wrong YOU MUST USE REASONING.

>
Like, THE DEFINITION of a Halt Decider?
>

Calling me a liar makes you a liar and a fool.

>
Your saying something doesn't exsit that you have been shown, and not doing one thing to prove your point just demonstartes that you are nothing but a stupid liar that is stuck in his own brainwashing.
>

 You have indicated that there is no mapping from the input to H(D,D)
to the behavior of D(D). This means that H cannot even see the behavior
of D(D). This means that H cannot be asked about the behavior of D(D).

No I haven't, and your claim is just another of your LIES.
Please cease and desist from defaming me in that manner, or I may be forced to file a defamation suit against you.
If you claim I have said this, WHERE and WHEN?
You are just proving your utter stupidity.

 

>
Then H is NOT a Halt Decider.
>

A halt decider is not and cannot be required to answer questions
that it is not ever being asked.

But just by BEING a "Halt Decider", the ONLY question it is EVERY askes

 Undecidability is not about being unable to correctly answer
questions that are not even being asked. You shallow understanding
of this is to be expected.

But the question IS being asked, it just seems to be over your tiny heads ability to understand.

 That you call me a liar on the basis of your own ignorance is very stupid, childish and perhaps a little crazy.
 

Nope, you are just projecting.