No one can correctly refute that simulating abort decider A(D,D) is correct

01 void B(ptr x) // ptr is pointer to void function
02 {
03   A(x, x);
04   return;
05 }
06
07 void main()
08 {
09   A(B,B);
10 }
*Execution Trace*
Line 09: main() invokes A(B,B);
*keeps repeating* (unless aborted)
Line 03: simulated B(B) invokes simulated A(B,B) that simulates B(B)
*Simulation invariant*
B correctly simulated by A cannot possibly reach past its own line 03.
The whole class of every A(B,B) that simulates its input
is divided into two sub-classes:
(a) A(B,B) that DOES NOT abort its simulation is incorrect
     (ABOUT THIS ABORT DECISION)
     because it would never halt and all deciders must always halt.
(b) A(B,N) that DOES abort its simulation is correct
     (ABOUT THIS ABORT DECISION)
     because it would halt and all deciders must always halt.
When I provide the same abort criteria that everyone can see
is obviously correct they lie about it.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer