Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: "Fred. Zwarts" <F.Zwarts@HetNet.nl>
Newsgroups: comp.theory
Subject: Re: DDD simulated by HHH cannot possibly halt (Halting Problem)
Date: Fri, 11 Apr 2025 10:21:28 +0200
Organization: A noiseless patient Spider
Lines: 75
Message-ID: <vtaje9$11ncr$2@dont-email.me>
References: <vsnchj$23nrb$2@dont-email.me> <vso4a5$302lq$1@dont-email.me>
 <vsqhuu$1hl94$2@dont-email.me> <vsqknb$1ldpa$1@dont-email.me>
 <vsrmn8$2o2f2$1@dont-email.me> <vstku7$p4u7$1@dont-email.me>
 <vsu95l$1c5kt$1@dont-email.me> <vt01l0$39kn7$1@dont-email.me>
 <vt28vk$1fe7a$1@dont-email.me> <vt2k6t$1onvt$1@dont-email.me>
 <vt3ef4$2flgf$1@dont-email.me> <vt3fgd$2gu7u$1@dont-email.me>
 <vt6apu$12sjs$2@dont-email.me> <vt6g1f$180qf$1@dont-email.me>
 <vt6h9k$18dp6$2@dont-email.me> <vt80mf$2k4l1$1@dont-email.me>
 <vt9jo5$2e73$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 11 Apr 2025 10:21:29 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="30999d8cdd8f6195aa73c602c96e28e6";
	logging-data="1105307"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19JQM/kCYW9S4WeRBBpGq1D"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1://C/Gp+XC3mBhbPv6hdcnrL/V3o=
In-Reply-To: <vt9jo5$2e73$1@dont-email.me>
Content-Language: nl, en-GB
Bytes: 4298

Op 11.apr.2025 om 01:20 schreef olcott:
> On 4/10/2025 3:49 AM, Fred. Zwarts wrote:
>> Op 09.apr.2025 om 21:20 schreef olcott:
>>> On 4/9/2025 1:58 PM, Fred. Zwarts wrote:
>>>> Op 09.apr.2025 om 19:29 schreef olcott:
>>>>>
>>>>> On 4/8/2025 10:31 AM, Fred. Zwarts wrote:
>>>>>> Op 08.apr.2025 om 17:13 schreef olcott:
>>>>>>> On 4/8/2025 2:45 AM, Fred. Zwarts wrote:
>>>>>>>> Op 08.apr.2025 om 06:33 schreef olcott:
>>>>>>>>>
>>>>>>>>> typedef void (*ptr)();
>>>>>>>>> int HHH(ptr P);
>>>>>>>>>
>>>>>>>>> int DD()
>>>>>>>>> {
>>>>>>>>>    int Halt_Status = HHH(DD);
>>>>>>>>>    if (Halt_Status)
>>>>>>>>>      HERE: goto HERE;
>>>>>>>>>    return Halt_Status;
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> int main()
>>>>>>>>> {
>>>>>>>>>    HHH(DD);
>>>>>>>>> }
>>>>>>>>>
>>>>>>>>> *Simulating termination analyzer Principle*
>>>>>>>>> It is always correct for any simulating termination
>>>>>>>>> analyzer to stop simulating and reject any input that
>>>>>>>>> would otherwise prevent its own termination.
>>>>>>>>
>>>>>>>>
>>>>>>>> In this case there is nothing to prevent, because the finite 
>>>>>>>> string specifies a program that halts. 
>>>>>>>
>>>>>>> int DD()
>>>>>>> {
>>>>>>>    int Halt_Status = HHH(DD);
>>>>>>>    if (Halt_Status)
>>>>>>>      HERE: goto HERE;
>>>>>>>    return Halt_Status;
>>>>>>> }
>>>>>>>
>>>>>>> This stuff is simply over-your-head.
>>>>>>> HHH(DD) meets the above: *Simulating termination analyzer Principle*
>>>>>>> Anyone with sufficient competence with the C programming language
>>>>>>> will understand this.
>>>>>>>
>>>>>> Everyone with a little bit of C knowledge understands that if HHH 
>>>>>> returns with a value 0, then DDD halts. 
>>>>>
>>>>> DDD CORRECTLY SIMULATED BY HHH
>>>>> NOT ANY OTHER DAMN DDD IN THE UNIVERSE NITWIT.
>>>>>
>>>> If HHH would correctly simulate DD (and the functions called by DD) 
>>>> then the simulated HHH would return to DD and DD would halt.
>>>
>>> No way, José:
>>> By "correctly simulate" I mean a simulation or an emulation
>>> of DD by HHH that obeys the semantics of the C or the x86utm
>>> programming languages respectfully. This expressly includes
>>> that HHH simulates/emulates itself simulating/emulating DD.
> 
>> That would make HHH to never halt.
> 
> *Simulating termination analyzer Principle*
> It is always correct for any simulating termination
> analyzer to stop simulating and reject any input that
> would otherwise prevent its own termination.
> 
Once you change the input to a DD using a HHH that aborts, there is 
nothing to prevent. It is only your dream of na infinite recursion that 
makes HHH abort, although the input has a behaviour with only finite 
recursions.