Re: Proving the: Simulating termination analyzer Principle

On 4/5/2025 7:54 PM, James Kuyper wrote:

On 06/04/2025 00:18, olcott wrote:
...

Termination analyzers are not required to be infallible.

 The Halting Problem refers to the impossibility of an infallible
termination analyzer. Fallible termination analyzers are trivially
possible - the question's not worth thinking about.

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);
}
They are not trivially possible for the above input.
*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.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer