Re: D correctly simulated by H cannot possibly halt --- templates and infinite sets

On 5/29/24 8:21 PM, olcott wrote:

On 5/29/2024 7:09 PM, Richard Damon wrote:

On 5/29/24 8:01 PM, olcott wrote:

On 5/29/2024 6:47 PM, Richard Damon wrote:

*Formalizing the Linz Proof structure*
∃H  ∈ Turing_Machines
∀x  ∈ Turing_Machines_Descriptions
∀y  ∈ Finite_Strings
such that H(x,y) = Halts(x,y)
>

>
And since NO H, can get right the H^ built to contradict IT, that claim is proven false.
>

>
YOU KEEP TRYING TO GET AWAY WITH CHANGING THE SUBJECT
THE ABOVE FORMALIZATION IS CORRECT
>

>
How?
>

 The above is the question that Linz asks and the he gets
an answer of no, no such H exists.
 

So, you now agree with Linz. Good.
So, you did you argue with me saying YOUR statement, which contradicts what Linz says, was right.
Or, do you still think that while you can't find an actual error in his proof, he must be wrong because you want the claim that a wrong answer can be correct?
That just proves your logic, and you mental state, is just inconsistant.