Re: H(D,D) cannot even be asked about the behavior of D(D) --- Boilerplate Reply

On 6/20/24 10:46 PM, olcott wrote:

On 6/20/2024 9:38 PM, Richard Damon wrote:

On 6/20/24 10:04 PM, olcott wrote:

On 6/20/2024 8:55 PM, Richard Damon wrote:

On 6/20/24 11:04 AM, olcott wrote:

On 6/20/2024 9:42 AM, Mikko wrote:

On 2024-06-20 05:15:37 +0000, olcott said:
>

On 6/20/2024 12:04 AM, Mikko wrote:

>

Sitll inclear whether you know what "termination analyzer" means.

>

I really don't care what you believe.
It is not about belief.
It is about correct reasoning.

>
No, it is not. It is about language maintenance. If you cannot present
your reasoning in Common Language it does not matter whether your
reasoning is correct.
>

>
I cannot possibly present my reasoning in a convincing way
to people that have already made up their mind and closed it
thus fail to trace through each step of this reasoning looking
for an error and finding none.

>
BNo, we are open to new ideas that have an actual factual
>

>
If you simply leap to the false assumption that I am wrong
yet fail to point out any mistake because there are no mistakes
this will only convince gullible fools that also lack sufficient
technical competence.
>

>
We don't leap from false assumption, we start with DEFINTIONS.
>

>
When it is defined that H(D,D) must report on the behavior
of D(D) yet the finite string D cannot be mapped to the
behavior of D(D) then the definition is wrong.
>
*You seem to think that textbooks are the word of God*
>

>
>
Why do you say it can not be "mapped"
>
Of course it can be mapped by the definition of mapping that decider are supposed to use, as
>

 You need to show every single freaking step of exactly
DDD correctly emulated by HH0 reaches past its own
machine address [0000209b] or all you have is BULLSHIT!

No, all *YOU* have is BULL-POOP in your head, as NOWHERE, but in your POOP-filled brain, is there any requirement that the mapping is defined by the steps of the decider. You just have the problem BACKWARDS, like most of your logic.
The question is CAN you build a decider to generate the defined mapping. No one is interested in the question of can you build a finite machine to compute the mapping that is generated by known finite steps.
Of course, for a logical-kindergartner like you maybe that would be a worth-will project to learn what computations are.
The halting mapping is determined by the DIRECT EXECUTION, as that is the DEFINITION.
To claim otherwise, just shows you to be a heretical LIAR, that has been cast out into the hell of illogical.

 _DDD()
[00002093] 55               push ebp
[00002094] 8bec             mov ebp,esp
[00002096] 6893200000       push 00002093 ; push DDD
[0000209b] e853f4ffff       call 000014f3 ; call HH0
[000020a0] 83c404           add esp,+04
[000020a3] 5d               pop ebp
[000020a4] c3               ret
Size in bytes:(0018) [000020a4]
 Maybe I need to make that my boilerplate reply to
everything that you ever say about anything until
you admit that you are wrong.
 

And just prove that you don't understand what you are talking about?
Of course, you have spent the last 20 years proving that.
I am sure tht a special room is being prepared for you to have you go over and over and over your own circular arguments for eternity.