How do simulating termination analyzers work? (V2)

void Infinite_Recursion()
{
   Infinite_Recursion();
   return;
}
void Infinite_Loop()
{
   HERE: goto HERE;
   return;
}
void DDD()
{
   HHH(DDD);
   return;
}
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;
}
My claim is that each of the above functions correctly
simulated by any termination analyzer HHH that can possibly
exist will never stop running unless aborted by HHH.
*No one has ever provided a correct rebuttal to that*
*In the several years that it has been reviewed*
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer