Re: How do simulating termination analyzers work?

Op 19.jun.2025 om 09:11 schreef olcott:

On 6/19/2025 1:50 AM, Mikko wrote:

On 2025-06-17 20:34:11 +0000, olcott said:
>

void Infinite_Recursion()
{
   Infinite_Recursion();
   return;
}
>
void Infinite_Loop()
{
   HERE: goto HERE;
   return;
}
>
void DDD()
{
   HHH(DDD);
   return;
}

>
Considering the scope of termination analysis the above examples are
extremely simple. The first two are easily seen as non-terminating.
The third example is incomplete as HHH is not given.

 *HHH is a simulating termination analyzer*
It simulates its input until it detects
a non halting behavior pattern, then it
aborts and rejects its input.

You close your eyes that adding the code to abort causes a change in behaviour. Then you pretend that the behaviour did not change. Very childish.
When it aborts, its simulation does not need to be aborted, because the correct simulation of an aborting analyser will reach the the abort code and halt.

 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.

And they will understand also that when the abort code is added, the simulation no longer needs to be aborted. Such students understand it better than you do.
Closing your eyes for the change in behaviour caused by the abort code and pretend that the behaviour does not change is very childish.
I think you understand it, because what could be another reason for the cheating Root variable in your code?