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

Op 15.jun.2024 om 14:14 schreef olcott:

On 6/15/2024 4:08 AM, Fred. Zwarts wrote:

Op 15.jun.2024 om 05:07 schreef olcott:

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

>
H does not answer questions.

 *Wrongo*
In computability theory and computational complexity theory, a
decision problem is a computational problem that can be posed
as a yes–no question of the input values.
https://en.wikipedia.org/wiki/Decision_problem

I am sorry to see that you think this question is asked to the program. It is not and it does not follow from your quote. The halting problem can be interpreted as a question, but it is not asked a program. Programs just run, without thinking about questions. The question is asked to the programmer to make a program that when given de description D of any program and its input, returns a boolean value that can be interpreted as an answer to the question whether D halts or not.
It is clear that we agree about the fact that no such program can be made. For most people that is not a surprise, because it has been proved about a century ago.