Sujet : Re: Proving the: Simulating termination analyzer Principle
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.lang.cDate : 05. Apr 2025, 22:29:03
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vss7av$375du$8@dont-email.me>
References : 1 2
User-Agent : Mozilla Thunderbird
On 4/5/2025 4:15 PM, dbush wrote:
On 4/5/2025 4:52 PM, olcott wrote:
*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.
>
void DDD()
{
HHH(DDD);
return;
}
Except when doing so would change the input, as is the case with HHH and DDD.
Changing the input is not allowed.
You may disagree that the above definition
of simulating termination analyzer is correct.
It is self-evident that HHH must stop simulating
DDD to prevent its own non-termination.
-- Copyright 2025 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer