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: Every sufficiently competent C programmer knows --- Very Stupid
 Mistake and Liars
Date: Thu, 13 Mar 2025 09:25:17 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <a4ebc1b9ed574cc28e31a39aa189b36ec3e48564@i2pn2.org>
References: <vqntaq$1jut5$1@dont-email.me> <vqp388$1tvqa$1@dont-email.me>
	<vqpdv9$202b2$2@dont-email.me> <vqperb$20c9k$2@dont-email.me>
	<E6mcnWv3nMa66036nZ2dnZfqnPWdnZ2d@brightview.co.uk>
	<vqqnk5$28jtr$1@dont-email.me> <vqqonm$28lh2$1@dont-email.me>
	<vqqq09$28kp8$1@dont-email.me> <vqqq7s$29buv$2@dont-email.me>
	<vqqqu3$28kp8$2@dont-email.me> <vqqrl7$29meg$2@dont-email.me>
	<vqqror$29k3n$1@dont-email.me> <vqqrv9$29meg$4@dont-email.me>
	<vqqs14$29k3n$3@dont-email.me> <vqqs5j$29meg$6@dont-email.me>
	<vqrkav$2h4l2$3@dont-email.me> <vqs9oh$2lqb2$2@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Thu, 13 Mar 2025 09:25:17 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="4155567"; 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 Wed, 12 Mar 2025 10:37:52 -0500 schrieb olcott:
> On 3/12/2025 4:32 AM, Fred. Zwarts wrote:
>> Op 12.mrt.2025 om 03:39 schreef olcott:
>>> On 3/11/2025 9:37 PM, dbush wrote:
>>>> On 3/11/2025 10:36 PM, olcott wrote:
>>>>> On 3/11/2025 9:32 PM, dbush wrote:
>>>>>> On 3/11/2025 10:31 PM, olcott wrote:
>>>>>>> On 3/11/2025 9:18 PM, dbush wrote:
>>>>>>>> On 3/11/2025 10:06 PM, olcott wrote:
>>>>>>>>> On 3/11/2025 9:02 PM, dbush wrote:
>>>>>>>>>> On 3/11/2025 9:41 PM, Richard Heathfield wrote:
>>>>>>>>>>> On 12/03/2025 01:22, olcott wrote:

>>>>>>>>>>>> DDD correctly simulated by HHH never reaches its own "return"
>>>>>>>>>>>> instruction and terminates normally in any finite or infinite
>>>>>>>>>>>> number of correctly simulated steps.
>>>>>>>>>>>
>>>>>>>>>>> If it correctly simulates infinitely many steps, it doesn't
>>>>>>>>>>> terminate. Look up "infinite".
>>>>>>>>>>> But your task is to decide for /any/ program, not just DDD.
>>>>>>>>>>> That, as you are so fond of saying, is 'stipulated', and you
>>>>>>>>>>> can't get out of it. The whole point of the
>>>>>>>>>>> Entscheidungsproblem is its universality. Ignore that, and you
>>>>>>>>>>> have nothing.
>>>>>>>>>>>
>>>>>>>>>> Given that his code has HHH(DD) returning 0,
>>>>>>>>>
>>>>>>>>> DDD correctly simulated by HHH never reaches its own "return"
>>>>>>>>> instruction and terminates normally in any finite or infinite
>>>>>>>>> number of correctly simulated steps.
>>>>>>>>>
>>>>>>>> Changing the input is not allowed.
>>>>>>>
>>>>>>> *You are simply lying that any input was ever changed*
>>>>>>>
>>>>>> You did precisely that when you hypothesize different code for HHH.
>>>>>> Changing the input is not allowed.
>>>>>
>>>>> HHH is the infinite set of every possible C function that correctly
>>>>> emulates N steps of its input where N any finite positive integer.
>>>>>
>>>> In other words, you're changing the input.
>>>> Changing the input is not allowed.
>>>
>>> It is an infinite set of HHH/DDD pairs having the property that DDD[0]
>>> ... DDD[N] never halts.
>>>
>> Proving that HHH[0] ... HHH[N} are unable to correctly complete the
>> simulation.
> 
> void Infinite_Loop()

> void Infinite_Recursion()

> In the exact same way that HHH cannot complete the simulation of the
> above functions.
> BECAUSE THEY SPECIFY NON-TERMINATING BEHAVIOR.

HHH terminates though.

-- 
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.