Path: ...!feeds.phibee-telecom.net!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
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?=
Date: Sun, 26 May 2024 22:47:47 -0500
Organization: A noiseless patient Spider
Lines: 54
Message-ID: <v30vp3$3s4od$1@dont-email.me>
References: <v2nsvh$1rd65$2@dont-email.me> <v2tp5n$22aq0$9@i2pn2.org>
 <v2tpdg$32me8$2@dont-email.me> <v2tptp$22aq1$13@i2pn2.org>
 <v2tq50$32r0d$2@dont-email.me> <v2tqh7$22aq1$15@i2pn2.org>
 <v2tr68$32uto$1@dont-email.me> <v2trch$23vgp$1@i2pn2.org>
 <v2trts$331vq$1@dont-email.me> <v2tsub$23vgp$2@i2pn2.org>
 <v2u0o5$33mgp$1@dont-email.me> <v2u2uf$23vgp$4@i2pn2.org>
 <v2u5a0$349br$2@dont-email.me> <v2u6if$23vgo$3@i2pn2.org>
 <v2u7fj$38fjo$1@dont-email.me> <v2v79q$25ell$2@i2pn2.org>
 <v2vg1g$3e8pb$4@dont-email.me> <v2vo5h$26570$3@i2pn2.org>
 <v2vpt6$3g0m3$3@dont-email.me> <v2vqou$26570$5@i2pn2.org>
 <v2vrcl$3gakv$1@dont-email.me> <v2vslp$26570$6@i2pn2.org>
 <v301m6$3hcgb$1@dont-email.me> <v305j9$26571$1@i2pn2.org>
 <v30e5l$3lerc$1@dont-email.me> <v30fbr$26570$9@i2pn2.org>
 <v30hiq$3lv80$1@dont-email.me> <v30jb5$26571$2@i2pn2.org>
 <v30pr8$3r67p$1@dont-email.me> <v30rvv$3riij$1@dont-email.me>
 <v30t8u$26571$6@i2pn2.org> <v30u04$3rour$1@dont-email.me>
 <v30upc$26571$7@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 27 May 2024 05:47:48 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="458305845cd025bf1a433877c96321fe";
	logging-data="4068109"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19ddtIHSgsWLQCUt9hwmBtu"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:ng6vwGlxK8/iwv5i9ybeoAVRLSA=
Content-Language: en-US
In-Reply-To: <v30upc$26571$7@i2pn2.org>
Bytes: 4291

On 5/26/2024 10:30 PM, Richard Damon wrote:
> On 5/26/24 11:17 PM, olcott wrote:
>> On 5/26/2024 10:05 PM, Richard Damon wrote:
>>> On 5/26/24 10:43 PM, olcott wrote:
>>>> On 5/26/2024 9:06 PM, olcott wrote:
>>>>> When Ĥ is applied to ⟨Ĥ⟩
>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
>>>>>
>>>>>   Ĥ copies its own Turing machine description: ⟨Ĥ⟩
>>>>>   then invokes embedded_H that simulates ⟨Ĥ⟩ with ⟨Ĥ⟩ as input.
>>>>>
>>>>> It is an easily verified fact that ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by
>>>>> embedded_H cannot possibly reach its own simulated final state of
>>>>> ⟨Ĥ.qn⟩ in any finite sequence of steps.
>>>>
>>>> *To other reviewers that are not dishonest*
>>>> The complete proof of the above statement is that when we hypothesize
>>>> that embedded_H is a UTM we can see that:
>>>
>>> i.e. when we assume it is something it isn't, i.e we LIE to ourselves.
>>>
>>> If you assume embedded_H is something it isn't, 
>>
>> Not at all.
>> *It looks like you may be utterly clueless about what-if scenarios*
> You can only ask what-ifs about things that are possible.
> 
>>
>> What-if embedded_H was a UTM would ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated
>> by embedded_H reach its own simulated final state of ⟨Ĥ.qn⟩ ?
>> (a) YES
>> (b) NO
>> (c) DISHONEST HONEST ATTEMPT TO CHANGE THE SUBJECT
> 
> So, If your H was a UTM, and H^ built on that, then embedded_H would be 
> a UTM and H^ (H^) would be non-halting as would H (H^) (H^).
> 

*Great this is a step of progress*
This conclusively proves that ⟨Ĥ⟩ will not reach ⟨Ĥ.qn⟩ is less than
an infinite number of steps. A decider is not allowed to simulate
an infinite number of steps.

> That just proves that you are just a pathological liar.

*You have a clownish lack of professionalism that academicians*
*coming into these posts for the first would find quite pathetic*
Several have called you out on this already.

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