Deutsch   English   Français   Italiano  
<vqq2cc$24m6v$2@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Every sufficiently competent C programmer knows
Date: Tue, 11 Mar 2025 14:19:40 -0500
Organization: A noiseless patient Spider
Lines: 84
Message-ID: <vqq2cc$24m6v$2@dont-email.me>
References: <vqntaq$1jut5$1@dont-email.me> <vqp388$1tvqa$1@dont-email.me>
 <vqpdv9$202b2$2@dont-email.me> <vqpg83$20qun$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 11 Mar 2025 20:19:41 +0100 (CET)
Injection-Info: dont-email.me; posting-host="350e987cc9d67c4a256c8784961aa56f";
	logging-data="2250975"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+C6Hc/aOSMtsSGLw93Pawl"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:s16BlvphIyau1dGT+LLLkUxOnpY=
Content-Language: en-US
X-Antivirus: Norton (VPS 250311-4, 3/11/2025), Outbound message
X-Antivirus-Status: Clean
In-Reply-To: <vqpg83$20qun$1@dont-email.me>
Bytes: 3643

On 3/11/2025 9:10 AM, Mikko wrote:
> On 2025-03-11 13:31:21 +0000, olcott said:
> 
>> On 3/11/2025 5:28 AM, Mikko wrote:
>>> On 2025-03-10 23:41:13 +0000, olcott said:
>>>
>>>> typedef void (*ptr)();
>>>> int HHH(ptr P);
>>>>
>>>> void Infinite_Loop()
>>>> {
>>>>    HERE: goto HERE;
>>>>    return;
>>>> }
>>>>
>>>> void Infinite_Recursion()
>>>> {
>>>>    Infinite_Recursion();
>>>>    return;
>>>> }
>>>>
>>>> void DDD()
>>>> {
>>>>    HHH(DDD);
>>>>    return;
>>>> }
>>>>
>>>> int DD()
>>>> {
>>>>    int Halt_Status = HHH(DD);
>>>>    if (Halt_Status)
>>>>      HERE: goto HERE;
>>>>    return Halt_Status;
>>>> }
>>>>
>>>> That when HHH correctly emulates N steps of the
>>>> above functions that none of these functions can
>>>> possibly reach their own "return" instruction
>>>> and terminate normally.
>>>
>>> Every competent programmer knows that the information given is
>>> insufficient to determine whether HHH emulates at all, and whether
>>> it emulates correctly if it does.
>>>
>>>> Since HHH does see that same pattern that competent
>>>> C programmers see it correctly aborts its emulation
>>>> and rejects these inputs as non terminating.
>>>
>>> Whether HHH does see those patterns cannot be inferred from the 
>>> information
>>> given. Only about DDD one can see that it halts if HHH returns. In 
>>> addition,
>>> the given information does not tell whether HHH can see patterns that 
>>> are
>>> not there.
>>>
>>> How many competent programmers you have asked?
>>>
>>
>> Two C programmers with masters degrees in computer science
>> agree that DDD correctly emulated by HHH cannot possibly
>> reach its own "return" instruction and terminate normally.
> 
> A masters degree in computer science does not guarantee any
> competence in C programming.
> 
> Two answers, even if similar, is not statistically significant.
> 

Mere competence in C completely proves my point.

When HHH correctly emulates N steps of the
above functions none of these functions can
possibly reach their own "return" instruction
and terminate normally.

For HHH(DDD) and HHH(DD) it is stipulated that
HHH does correctly emulate itself emulating
these inputs.


-- 
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer