Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Halt Deciders must be computable functions --- dbush was always
 wrong
Date: Mon, 24 Mar 2025 07:23:44 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <3c463a92b9afe912e1438ea78bf04d346b9a6ae3@i2pn2.org>
References: <vr1shq$1qopn$1@dont-email.me> <vr9elt$bv13$2@dont-email.me>
 <vr9jpt$gave$2@dont-email.me> <vr9lj6$j0f0$2@dont-email.me>
 <vr9qu8$m4cu$2@dont-email.me> <vr9ttl$q57o$1@dont-email.me>
 <vr9udn$m4cu$3@dont-email.me> <vr9utm$qp25$1@dont-email.me>
 <vr9vqm$6dfe$1@dont-email.me> <vra0rj$s8bo$1@dont-email.me>
 <vra1qb$6dfe$2@dont-email.me> <vra6lc$11p12$1@dont-email.me>
 <vra6t7$6dfe$3@dont-email.me> <vraci2$16s8e$1@dont-email.me>
 <vrad2v$6dfe$4@dont-email.me> <vrae5c$16s8e$2@dont-email.me>
 <vraec6$6dfe$5@dont-email.me> <vrafln$16s8e$3@dont-email.me>
 <vrafrv$6dfe$6@dont-email.me> <vrahld$16s8e$4@dont-email.me>
 <vrai2i$6dfe$7@dont-email.me> <vrapae$1hild$1@dont-email.me>
 <vrju06$1p5m7$1@dont-email.me> <vrjuti$1ph95$1@dont-email.me>
 <vrk0cl$1qle0$1@dont-email.me> <vrmj54$6grp$1@dont-email.me>
 <vrmm1n$5bpl$6@dont-email.me> <vrolfd$23fvd$1@dont-email.me>
 <vrppnr$34p5p$1@dont-email.me>
 <4dddcc0340b82c30e5edd1e27d31320972b3eb4a@i2pn2.org>
 <vrqaom$3k9kh$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 24 Mar 2025 11:23:44 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1537819"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <vrqaom$3k9kh$1@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 3123
Lines: 33

On 3/23/25 8:59 PM, olcott wrote:
> On 3/23/2025 7:01 PM, joes wrote:
>> Am Sun, 23 Mar 2025 15:08:25 -0500 schrieb olcott:
>>
>>> The behavior of a directly executing Turing Machine cannot be computed
>>> because a directly executing Turing machine cannot be the input to any
>>> computable function.
>> Lol. This is such a ridiculously silly objection. Of course a TM is
>> nothing but a finite string (or can be encoded as such). TMs are
>> most definitely computable - UTMs are possible.
>>
> 
> It is enormously more nuanced than that.
> https://www.liarparadox.org/Linz_Proof.pdf
> 
> Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.UTM ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn

Incorrect, UTM was never there;, so you are just showing that your logic 
was a lie.

> 
> When we define the Peter Linz Ĥ with a UTM
> that simulates a finite number of "moves"
> before transitioning to Ĥ.qn then Ĥ reaches
> Ĥ.qn and the simulated ⟨Ĥ⟩ cannot possibly
> reach ⟨Ĥ.qn⟩.
> 

Which is impossible, as such a thing is not a UTM.

You are just showing that your logic is based on the presumption of the 
impossible and lies to fill the holes.

Sorry, you are just burying your reputation in the lake of fire.