Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.org>
Newsgroups: comp.theory
Subject: Re: =?iso-8859-13?Q?Flibble=FFs?= Leap: Why Behavioral Divergence
 Implies a Type Distinction in the Halting Problem
Date: Mon, 12 May 2025 09:29:15 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <1a1f3e6b27d7a37fe24d16db4fd7bba7106ddf38@i2pn2.org>
References: <vv1UP.77894$JJT6.54808@fx16.ams4> <vvqd4u$g8a1$1@dont-email.me>
	<7N2UP.527443$wBt6.464256@fx15.ams4> <vvqfgq$gmmk$1@dont-email.me>
	<os3UP.670056$BFJ.223954@fx13.ams4> <vvqgpt$gmmk$4@dont-email.me>
	<aG3UP.366972$wBVe.321504@fx06.ams4> <vvqhaj$gldn$6@dont-email.me>
	<bV3UP.101097$0ia.1168@fx11.ams4> <vvqkff$gldn$13@dont-email.me>
	<WH4UP.229898$_Npd.172992@fx01.ams4> <vvqm03$i3hn$1@dont-email.me>
	<g55UP.688178$4AM6.545580@fx17.ams4>
	<87o6vy4ulc.fsf@nosuchdomain.example.com> <vvrb1g$me5h$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 12 May 2025 09:29:15 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="4807"; 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 Sun, 11 May 2025 18:14:56 -0500 schrieb olcott:
> On 5/11/2025 6:05 PM, Keith Thompson wrote:
>> Mr Flibble <flibble@red-dwarf.jmc.corp> writes:

>>> To usefully advance research in this area pathological input needs to
>>> be excluded from the set of programs that can be analysed by a
>>> decider.
>> 
>> Can this exclusion be performed reliably and consistently?
>> 
> That is a good question. The answer is definitely yes. When HHH emulates
> DDD it only needs to see that DDD is calling itself with no conditional
> branch instructions inbetween.
Now that is counter to the facts (besides, DDD doesn't call itself, it
calls a simulator): there is a conditional branch in HHH.

> Whether a function computed by a Turing machine can do this is a
> different question.
(Mathematical functions don't "do" anything, algorithms do.)
-- 
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.