| Deutsch English Français Italiano |
|
<5acc22f83441f7be0be1dbb0bb3dbb26a90a7b38@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
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 <noreply@example.org>
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: <TuuNP.2706011$nb1.2053729@fx01.ams4>
<991dde3a60e1485815b789520c7149e7842d18f2@i2pn2.org>
<vuti3c$jq57$1@dont-email.me> <vutmr6$nvbg$2@dont-email.me>
<vutv7r$v5pn$4@dont-email.me> <vuu73m$151a8$3@dont-email.me>
<vuuej8$1cqp7$1@dont-email.me> <vuur2n$1qe3m$2@dont-email.me>
<vv0352$2ur4q$1@dont-email.me> <vv0kpi$3djh5$1@dont-email.me>
<vv13ro$3r3ei$1@dont-email.me> <vv160a$3smj7$1@dont-email.me>
<vv18s7$3uer0$1@dont-email.me> <vv1b03$4a4k$2@dont-email.me>
<vv1bav$3ra6l$7@dont-email.me> <vv1frt$97hp$1@dont-email.me>
<vv1gfu$3ra6l$8@dont-email.me> <vv1js4$d4ik$1@dont-email.me>
<-GOdnZvgEPn-84j1nZ2dnZfqn_SdnZ2d@brightview.co.uk>
<vv5e46$3rtqo$1@dont-email.me>
<2qydnbbWA6CAGIv1nZ2dnZfqn_SdnZ2d@brightview.co.uk>
<87frhjamvt.fsf@bsb.me.uk> <vv93tq$383jd$1@dont-email.me>
<d3d98f966d50e250c233a6e883a4947c885bd99f@i2pn2.org>
<vvbsjf$1us1f$5@dont-email.me>
<313c6e5a3816ff483563120b589b22d1bc190c2f@i2pn2.org>
<vvdi2p$3cbpq$7@dont-email.me>
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 <news.dead.person.stones@darjeeling.plus.com> 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.
>>>>>>
>>>>> <MIT Professor Sipser agreed to ONLY these verbatim words
>>>>> 10/13/2022>
>>>>> </MIT Professor Sipser agreed to ONLY these verbatim words
>>>>> 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*
>>> <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
>>> 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.