Re: Working out the details of the steps of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ <Ĥ> ⊢* Ĥ.Hqn

On 3/8/2024 10:58 PM, Richard Damon wrote:

On 3/8/24 8:45 PM, olcott wrote:

On 3/8/2024 10:33 PM, Richard Damon wrote:

On 3/8/24 8:20 PM, olcott wrote:

On 3/8/2024 9:41 PM, Richard Damon wrote:

On 3/8/24 7:06 PM, olcott wrote:

Ĥ.H computes the mapping from ⟨Ĥ⟩ ⟨Ĥ⟩ <Ĥ> to Ĥ.Hqn
therefore
H computes the mapping from ⟨Ĥ⟩ ⟨Ĥ⟩ <H> to H.qy
>
I still don't know the detailed steps of how
H computes the mapping from ⟨H⟩ ⟨H⟩ <H> to H.qy
YET WE CAN SEE THAT IT IS CORRECT

>
No, you see that you have a set of results that makes

>
Every H needs a criteria to use whether it is contradicted
or not. When it is not contradicted this same criteria
correctly decides halting for its input.
>
When H is contradicted it provides a consistent way
that H can provide the wrong answer.

>
But if you admit that it will get a wrong answer, how can you claim it is a correct Halt Decider, which means it always gets the Right answer.
>

>
When the input data gets the wrong answer this allows the
actual decider to get the right answer.

 But the algorith at H^.H IS an instanc eof the decide,r, and must get the answer right.
 You are just admitting to being a STUPID LIAR.

You are the one that does not understand that making changes to
a machine to so it will not work properly does make this machine
not work properly.

>

You are just admitting that you are lying about refuting the proof that we can not make an always correct Halt Decider.
>
You don't get to claim to be right, when the machine gives the wrong answer.
>

>
You already know that Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ must be aborted by Ĥ.H
or it will never halt.
>
When every H has the same way to say that, then when it is
contradicted it has something to say and when it is not
contradicted this is the correct halt status of its input.
>

>
No, if ANY copy of H gives the wrong answer to some input, then H is not a Halt Decider.

>
When the input data gets the wrong answer this allows the
actual decider to get the right answer.

 And thus you admit that H is WRONG, as all copies of it are the ACTUAL DECIDER.
 

I never said anything like that. I say that Ĥ.H and you twist
this to man that I said H was wrong.

That is the nature of a Computation.
 ANY instance of the algorithm applied to its input must get the same answer for the same data and to be correct must match the mapping that it is supposed to derive.
 

*Every H reports whether its input halts from its POV*
This causes contradicted instances to get the wrong answer
Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ <Ĥ> ↦ Ĥ.Hqn
This causes uncontradicted instances to get the right answer
H ⟨Ĥ⟩ ⟨Ĥ⟩ <H> ↦ H.qy

You are just proving you don't understand the definition of the field, but claim to be following them by saying you are working on the Halting Problem.
 

>

>
Just saying "something" when stuck, doesn't make it correct.
>

>

 

--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer