Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: joes <noreply@example.org>
Newsgroups: comp.theory
Subject: Re: Every sufficiently competent C programmer knows --- Paraphrase of
 Sipser's agreement
Date: Sun, 16 Mar 2025 12:31:17 -0000 (UTC)
Organization: i2pn2 (i2pn.org)
Message-ID: <1571d378add9779a0986b4df903964c7241f94a7@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>
	<vqpv2u$23vhr$1@dont-email.me>
	<Ny-dnRlMHcVpA036nZ2dnZfqnPqdnZ2d@brightview.co.uk>
	<vqrjrn$2h4l2$1@dont-email.me>
	<nESdnUfJxdhoTkz6nZ2dnZfqnPSdnZ2d@brightview.co.uk>
	<vqsl7c$2ok91$1@dont-email.me>
	<f7b6995ae3e79db00fa5070d9be8126b7ea5ae78@i2pn2.org>
	<vqt99l$2spcd$5@dont-email.me> <vqu84v$363tm$1@dont-email.me>
	<vqvgpn$3s1qt$4@dont-email.me> <vr0rcu$10780$1@dont-email.me>
	<vr1f32$1ev1a$4@dont-email.me> <vr3jpq$3abnf$1@dont-email.me>
	<vr4rb6$bkso$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 16 Mar 2025 12:31:17 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="429524"; 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
Bytes: 3830
Lines: 61

Am Sat, 15 Mar 2025 16:27:00 -0500 schrieb olcott:
> On 3/15/2025 5:12 AM, Mikko wrote:
>> On 2025-03-14 14:39:30 +0000, olcott said:
>>> On 3/14/2025 4:03 AM, Mikko wrote:
>>>> On 2025-03-13 20:56:22 +0000, olcott said:
>>>>> On 3/13/2025 4:22 AM, Mikko wrote:
>>>>>> On 2025-03-13 00:36:04 +0000, olcott said:
>>>>>>
>>>>>>
>>>>>>> void DDD()
>>>>>>> {
>>>>>>>    HHH(DDD);
>>>>>>>    return;
>>>>>>> }
>>>>>>> int DD()
>>>>>>> {
>>>>>>>    int Halt_Status = HHH(DD);
>>>>>>>    if (Halt_Status)
>>>>>>>      HERE: goto HERE;
>>>>>>>    return Halt_Status;
>>>>>>> }
>>>>>>>
>>>>>>> When HHH correctly emulates N steps of the above functions none of
>>>>>>> them can possibly reach their own "return" instruction and
>>>>>>> terminate normally.
>>>>>>
>>>>>> Nevertheless, assuming HHH is a decider, Infinite_Loop and
>>>>>> Infinite_Recursion specify a non-terminating behaviour, DDD
>>>>>> specifies a terminating behaviour
>>>>>
>>>>> What is the sequence of machine language instructions of DDD
>>>>> emulated by HHH such that DDD reaches its machine address 00002183?
>>>>
>>>> Irrelevant off-topic distraction.
>>>
>>> Proving that you don't have a clue that Rice's Theorem is anchored in
>>> the behavior that its finite string input specifies.
>> 
>> Another irrelevant off-topic distraction, this time involving a false
>> claim.
>> One can be a competent C programmer without knowing anyting about
>> Rice's Theorem.
> YES.
>
>> Rice's Theorem is about semantic properties in general, not just
>> behaviours.
>> The unsolvability of the halting problem is just a special case.
>> 
> Does THE INPUT TO simulating termination analyzer HHH encode a C
> function that reaches its "return"
> instruction [WHEN SIMULATED BY HHH] (The definition of simulating
> termination analyzer) ???
That can't be right. Otherwise my simulator could just not simulate
at all and say that no input halts.

> <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
> </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
key word "correctly"

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