Sujet : Re: D correctly simulated by H cannot possibly halt --- templates and infinite sets
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory sci.logicDate : 30. May 2024, 01:53:15
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v38ilr$1c8ir$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12
User-Agent : Mozilla Thunderbird
On 5/29/2024 7:47 PM, Richard Damon wrote:
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.
I said that Linz says that. The point is that the Linz
template examines an infinite set of Turing Machine / input
pairs the same way my H/D template references an infinite set
of C function / input pairs.
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer
…