Path: ...!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory,sci.logic
Subject: =?UTF-8?Q?Re=3A_A_simulating_halt_decider_applied_to_the_The_Peter_?=
 =?UTF-8?Q?Linz_Turing_Machine_description_=E2=9F=A8=C4=A4=E2=9F=A9_--_key_d?=
 =?UTF-8?Q?etails?=
Date: Sat, 1 Jun 2024 15:45:59 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <v3ftpn$2n53n$13@i2pn2.org>
References: <v2nsvh$1rd65$2@dont-email.me> <v327h8$3a17$1@dont-email.me>
 <v328l1$28n58$2@i2pn2.org> <v329t8$3mh0$2@dont-email.me>
 <v32ait$28n58$4@i2pn2.org> <v32bvc$48pj$1@dont-email.me>
 <v32cko$2937i$1@i2pn2.org> <v32nsa$6fo3$1@dont-email.me>
 <v32tfs$29dee$1@i2pn2.org> <v331mf$84p2$1@dont-email.me>
 <v332ci$29def$2@i2pn2.org> <v33790$8u5p$1@dont-email.me>
 <v337r0$29dee$2@i2pn2.org> <v338c5$94g8$1@dont-email.me>
 <v339kr$29dee$3@i2pn2.org> <v33aj7$9f3u$1@dont-email.me>
 <v33bo5$29def$4@i2pn2.org> <v33dt7$dlnv$1@dont-email.me>
 <v33f6d$29dee$4@i2pn2.org> <v33g9j$e3ug$1@dont-email.me>
 <v33gss$29def$6@i2pn2.org> <v33hbf$e6qn$1@dont-email.me>
 <v34fg0$2bb65$2@i2pn2.org> <v36pgt$12lh7$1@dont-email.me>
 <v379la$159q4$2@dont-email.me> <v398hu$1j7to$1@dont-email.me>
 <v39ue9$1mtd9$3@dont-email.me> <v3chls$280e0$1@dont-email.me>
 <v3cqnm$29gdk$1@dont-email.me> <v3ek0l$2maau$1@dont-email.me>
 <v3fbme$2qsgd$1@dont-email.me> <v3fqkp$2o13h$7@i2pn2.org>
 <v3fsm0$2uah1$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 1 Jun 2024 19:45:59 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2856055"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
Content-Language: en-US
In-Reply-To: <v3fsm0$2uah1$1@dont-email.me>
Bytes: 3971
Lines: 46

On 6/1/24 3:26 PM, olcott wrote:
> On 6/1/2024 1:52 PM, joes wrote:
>> Am Sat, 01 Jun 2024 09:37:01 -0500 schrieb olcott:
>>> On 6/1/2024 2:52 AM, Mikko wrote:
>>>> On 2024-05-31 15:35:18 +0000, olcott said:
>>
>>>>> *A quick summary of the reasoning provided below*
>>>>> The LHS is behavior that embedded_H is allowed to report on.
>>>> There is no restrictions on what embedded_H is allowed to report on.
>>>
>>> embedded_H is only allowed to report on the behavior that its finite
>>> string Turing Machine Description specifies to a UTM.
>>>
>>> embedded_H <is> a UTM except that it stops simulating and reports
>>> non-halting as soon as it correctly recognizes a non-halting behavior
>>> pattern that is specified by its input.
>> "Except". So it is not an UTM.
>>
>>> When Ĥ is applied to ⟨Ĥ⟩
>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>
>>> (a) Ĥ copies its input ⟨Ĥ⟩
>>> (b) Ĥ invokes embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩
>>> (c) embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩
>>> (d) simulated ⟨Ĥ⟩ copies its input ⟨Ĥ⟩
>>> (e) simulated ⟨Ĥ⟩ invokes simulated embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩
>>> (f) simulated embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩
>>> (g) goto (d)
>>>
>>> embedded_H is not allowed to be applied to Ĥ ⟨Ĥ⟩ because inputs can
>>> only be finite strings and Ĥ is not a finite string. This means
>>> that embedded_H is not allowed to report on its own actual behavior.
>> I can't read that notation. What is H^ and what does it look like?
>>
> 
> *Here is the whole Linz proof*
> I simplified the Linz notation at the bottom of page 2 of the proof.
> https://www.liarparadox.org/Linz_Proof.pdf
> 
> 

Yes, you "simplified" it by removing essential parts of the requirements 
listed.

Probably because you don't understand what they mean, because 
requirements don't seem to mean anything to you.