Re: Proving the: Simulating termination analyzer Principle

On 4/11/2025 3:57 PM, Richard Heathfield wrote:

On 11/04/2025 21:00, Chris M. Thomasson wrote:
 <snip>
 

Does your halt decider work or not?

 Obviously not. If we had a working decision procedure we could use it to prove it doesn't work.
 

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);
}
*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.
The only rebuttal to this is to stupidly reject the notion
that all deciders must always halt.
HHH detects this pattern through mathematical induction
of n steps of DD emulated/simulated by HHH. The criteria
is that the emulated/simulated DD fails to ever reach its
own “return instruction” final halt state.
The only "proof" that HHH does not work correctly on
every element in its domains requires disagreeing with
verified facts.
https://github.com/plolcott/x86utm/blob/master/Halt7.c
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer