Sujet : Re: D correctly simulated by H cannot possibly halt --- templates and infinite sets
De : news (at) *nospam* immibis.com (immibis)
Groupes : comp.theoryDate : 30. May 2024, 19:58:12
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v3aenk$1ptlh$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
User-Agent : Mozilla Thunderbird
On 30/05/24 15:11, olcott wrote:
On 5/30/2024 4:11 AM, joes wrote:
Am Wed, 29 May 2024 22:48:45 -0500 schrieb olcott:
*A deciders compute the mapping*
FROM ITS INPUTS
*to it own accept or reject state*
>
*Deciders cannot take*
ACTUAL TURING MACHINES AS INPUTS
>
*Deciders can only take*
FINITE STRINGS AS INPUTS
Poetic.
What is an „actual Turing machine”?
>
*Formalizing the Linz Proof structure*
∃H ∈ Turing_Machines
∀x ∈ Turing_Machine_Descriptions
∀y ∈ Finite_Strings
such that H(x,y) = Halts(x,y)
Every H is an actual Turing_Machine
Every x is a Turing_Machine_Description
thus not an actual Turing_Machine
∃H ∈ Turing_Machines
∀x ∈ Turing_Machines
∀y ∈ Finite_Strings
such that H(DescriptionOf(x),y) = Halts(x,y)
…