Re: Proving the: Simulating termination analyzer Principle

On 06/04/2025 02:09, olcott wrote:

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.

Sure they are.
unsigned hhh(ptr P)
{
   unsigned r = rand();
   return r * (unsigned)P;
}
Getting it wrong is a walk in the park. Nobody disputes your claim that you can write broken code.
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within