Re: How do simulating termination analyzers work? (in C and C++)

On 2025-06-18 15:40:12 +0000, olcott said:

On 6/18/2025 10:11 AM, Bonita Montero wrote:

Am 18.06.2025 um 16:59 schrieb olcott:

On 6/17/2025 6:24 PM, olcott wrote:

void Infinite_Recursion()
{
   Infinite_Recursion();
   return;
  }
 void Infinite_Loop()
  {
   HERE: goto HERE;
   return;
  }
 void DDD()
  {
   HHH(DDD);
   return;
  }
 When it is understood that HHH does simulate itself
simulating DDD then any first year CS student knows
that when each of the above are correctly simulated
by HHH that none of them ever stop running unless aborted.
(recursive simulation is similar to infinite recursion).
 The same thing equally applies to these two, yet they may
be  too difficult for a first year CS student.
 int Sipser_D()
  {
   if (HHH(Sipser_D) == 1)
     return 0;
   return 1;
}
 int DD()
  {
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
  }
 *Fully operational code*
https://github.com/plolcott/x86utm/blob/master/Halt7.c
 

 I am only asking whether or not people here can understand
that when each of the above functions are correctly simulated
by simulating termination analyzer HHH that they would never
stop running unless aborted. *Please start with the first three*
 

 Ask in comp.theory, here your posting is wrong.

 Asking about the behavior of a C function in a C group
is not wrong.

It is if essential aspects of the bhaviour depend on non-standard
extensions to C.
Nobody is going to answer about a complex program. The way to ask about
a complex program is to ask the same question about a simple program.
--
Mikko