Re: Proving the: Simulating termination analyzer Principle

On 4/5/25 9:15 PM, olcott wrote:

On 4/5/2025 5:11 PM, Richard Damon wrote:

On 4/5/25 4:51 PM, olcott wrote:

*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.
>
void DDD()
{
    HHH(DDD);
    return;
}
>
Anyone knowing the C programming language knows
that DDD simulated by HHH by any correct pure
simulator would prevent HHH from terminating.
>

>
Which means it must be CORRECT,

 In that HHH really would never halt unless it
stops simulating DDD.
 

So you admit that you HHH doesn't qualify as a decider, since it doesn't halt unless something make it?
But of course, it does abort, so that logic doesn't apply, but then that also applies to DDD, so DDD is also halting.
You just don't understand what a PROGRAM is.
The actual code that it has, defines the program.
Either the code HAS the abort condition defined, and that same code is used by DDD, so DDD will halt, or that code doesn't have that condition defined in it, and neither abort, and thus your HHH fails to be a decider.
You are just proving how stupid and ignorant you are, and how far you will try to reach to find a lie to try to make you crazy statements seem to be true.
Sorry, but you are just proving how much of an ignorant and stupid pathological lying idiot you are. You just don't know what you are talking about, but are just to damned stupid to see it.