Re: 195 page execution trace of DDD correctly simulated by HH0 ---Boilerplate Reply

On 6/21/24 1:55 PM, olcott wrote:

On 6/21/2024 12:40 PM, Richard Damon wrote:

On 6/21/24 1:22 PM, olcott wrote:

>
When there is no mapping from the finite string x86 machine
language input to H(D,D) to the  behavior of D(D) then
H(D,D) IS NOT being asked about the behavior of D(D).

>
But there *IS* a mapping, it just isn't a COMPUTABLE MAPPING.
>

 If there is a mapping yet not a computable mapping then
the actual halt decider cannot even see the question that
the textbooks expect it to see.

But a decider doesn't "See" the question. it just computes the result it was programmed to give.
You don't seem to understand what a program is. Maybe you are just a badly trained AI that was never trained on computer theory.

 This is not the same thing as the inability to correctly
answer this question. This is something brand new that has
never been thought of before.
 

Right, you are just proving you have no idea about what programming is about.
sorry, you are just to stupid to understand.
Maybe it has never been though of before as it is so based on false ideas that no one has ever been that lost in their logic.