Re: Liar detector: Fred, Richard, Joes and Alan --- Richard is a Liar?

On 7/6/24 5:08 PM, olcott wrote:

On 7/6/2024 4:06 PM, Richard Damon wrote:

On 7/6/24 5:02 PM, olcott wrote:

On 7/6/2024 3:27 PM, Richard Damon wrote:

On 7/6/24 3:14 PM, olcott wrote:

On 7/6/2024 1:55 PM, Fred. Zwarts wrote:

Op 06.jul.2024 om 18:30 schreef olcott:

On 7/6/2024 10:29 AM, Fred. Zwarts wrote:

>
So, why do you disagree that the x86 code specifies an HHH that aborts and halts?

>
Dishonest dodge of changing the subject. This is called
the strawman deception and is a favorite tactic of liars.

>
Irrelevant text ignored. You talked about x86, therefore continuing to talk about x86 is not a change of subject.
I know you have difficulties to recognize the truth, so I do not feel offended, because: 'Don't assume somebody is wilfully wrong, if incompetence could be an explanation, as well.'
>

>
If you sufficiently understand the semantics of the x86
language then you can see that the call to HHH(DDD) from
DDD simulated according to the semantics of the x86 language
cannot possibly return.

>
I understand enough of it to see that it cannot possibly return, because HHH cannot possibly simulate itself correctly.

>
According to the semantics of the x86 language IS IS IMPOSSIBLE
FOR DDD SIMULATED BY HHH TO RETURN AND IT IS EQUALLY IMPOSSIBLE
FOR THE HHH(DDD) CALLED BY DDD SIMULATED BY HHH TO RETURN.
>
I can't tell that you are ignorant or a liar and it is reaching
the point where I don't care which it is.
>

>
No, the DDD that HHH simulated MUST return since HHH aborts its simulation and returns.
>

>
By this same reason there is never any reason for you
to go to the grocery store to buy groceries after you
already made up your mind that you will do this.
>

>
Why do you say that?
>
You are just making bad analogies.

 HHH cannot report on what it did before it does this.
HHH must report on what it must do now.

No, HHH must report on what DDD actually does when run, if it is to be a decider.
The fact that it can't know, is what make the problem impossiblely hard.
You get confused because you forget that both HHH and DDD are deterministic programs. HHH *CAN* only answer what its algorithm tells it to do, and that algorithm is fixed by the instructions that make up HHH.
Just as DDD, does exactly what the instructions of DDD tell it to do, which INCLUDE the instructions of the HHH that it uses.
Thus, HHH has one and only one answer that it can give for each input, and DDD has one and only one behavior.
Since the one answer that HHH gives when given the representation of DDD, doesn't match that behavior of DDD, HHH is just proven to be incorrect.
The fact that for ANY decider we might try to create, we can make an input by the contrary behavior template that it will get wrong, shows us that Halting is a behavior that can not be solved by a computation.
Doesn't make the problem wrong or invalid, just not computable, as there is no requirement that the questions we try to put to a decider are computable. We can only succeed if they are.