Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!news.quux.org!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail From: joes Newsgroups: comp.theory Subject: Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs --- MT Date: Tue, 6 May 2025 20:25:36 -0000 (UTC) Organization: i2pn2 (i2pn.org) Message-ID: <5acc22f83441f7be0be1dbb0bb3dbb26a90a7b38@i2pn2.org> References: <991dde3a60e1485815b789520c7149e7842d18f2@i2pn2.org> <-GOdnZvgEPn-84j1nZ2dnZfqn_SdnZ2d@brightview.co.uk> <2qydnbbWA6CAGIv1nZ2dnZfqn_SdnZ2d@brightview.co.uk> <87frhjamvt.fsf@bsb.me.uk> <313c6e5a3816ff483563120b589b22d1bc190c2f@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Injection-Date: Tue, 6 May 2025 20:25:36 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="3354655"; mail-complaints-to="usenet@i2pn2.org"; posting-account="nS1KMHaUuWOnF/ukOJzx6Ssd8y16q9UPs1GZ+I3D0CM"; User-Agent: Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2) X-Spam-Checker-Version: SpamAssassin 4.0.0 Am Tue, 06 May 2025 12:49:13 -0500 schrieb olcott: > On 5/6/2025 6:23 AM, Richard Damon wrote: >> On 5/5/25 10:36 PM, olcott wrote: >>> On 5/5/2025 8:23 PM, Richard Damon wrote: >>>> On 5/4/25 9:23 PM, olcott wrote: >>>>> On 5/4/2025 8:04 PM, Ben Bacarisse wrote: >>>>>> Mike Terry writes: >>>>>> ... >>>>>>> As explained above, UTM(⟨Ĥ⟩ ⟨Ĥ⟩) simulates Ĥ run with input Ĥ >>>>>>> (having the same halting behaviour) and Ĥ run with input Ĥ HALTS.  >>>>>>> So embedded_H does not "gather enough information to deduce that >>>>>>> UTM(⟨Ĥ⟩ ⟨Ĥ⟩) would never halt".  THAT IS JUST A FANTASY THAT YOU >>>>>>> HAVE. >>>>>>> UTM(⟨Ĥ⟩ ⟨Ĥ⟩) DOES halt, so embedded_H can't possibly gather >>>>>>> information that genuinely implies it DOESN'T halt.  The >>>>>>> explanation is obvious: embedded_H gathers information that *YOU* >>>>>>> believe implies that UTM(⟨Ĥ⟩ ⟨Ĥ⟩) >>>>>>> would never halt, but *YOU ARE SIMPLY WRONG*. >>>>>> >>>>>> He used to claim that false ("does not halt") was the correct >>>>>> answer, >>>>>> /even though/ the computation in question halts!  Those were >>>>>> simpler days.  Of course cranks will never admit to having been >>>>>> wrong about anything other than a detail or two, so anyone who >>>>>> could be bothered could try to get him to retract that old claim. >>>>>> >>>>> >>>> 10/13/2022> >>>>> >>>> 10/13/2022> >>>>> >>>>> When Ĥ is applied to ⟨Ĥ⟩ >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >>>>> >>>>> In other words embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ is correct to reject its input if >>>>> >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* UTM ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* UTM ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn Would not halt. >>>> >>>> Nope, because that isn't the input that it was given. >>> >>> *Wrong* >>> >>>      If simulating halt decider H correctly simulates its input D >>>      until H correctly determines that its *simulated D would >>>      never stop running unless aborted* then >>> >>> *simulated D would never stop running unless aborted* >>> simulated D (the actual input) >>> never stop running unless aborted (hypothetical H/D pair) >>> >> No, that is changing the input. >> > *would never stop running unless aborted* means the hypothetical same > HHH that DD calls except that this HHH does not abort. Yes, that is not the same HHH. -- Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math: It is not guaranteed that n+1 exists for every n.