Liste des Groupes | Revenir à s logic |
00 int H(ptr x, ptr x) // ptr is pointer to int functionI only had to add this new step because I found that some people just
01 int D(ptr x)
02 {
03 int Halt_Status = H(x, x);
04 if (Halt_Status)
05 HERE: goto HERE;
06 return Halt_Status;
07 }
08
09 void main()
10 {
11 H(D,D);
12 }
We are examining the behavior of D(D) for every possible H/D pair
where 1 to N steps of D(D) are simulated by H.
*Execution Trace*
Line 11: main() invokes H(D,D) that simulates D(D)
*keeps repeating* (unless aborted)
Line 01
Line 02
Line 03: simulated D(D) invokes simulated H(D,D) that simulates D(D)
*Simulation invariant*
D correctly simulated by H cannot possibly reach past its own line 03.
(a) It is a verified fact that for every possible H/D pair where
1 to N steps of D(D) are simulated by H that this simulated D(D)
cannot possibly reach past its own line 03.
(b) Rebuttals must show a counter example where 1 to N steps--
of D(D) are simulated by H and the simulated D(D) reaches past
its own line 03.
*Termination Analyzer H is Not Fooled by Pathological Input D*
https://www.researchgate.net/publication/369971402_Termination_Analyzer_H_is_Not_Fooled_by_Pathological_Input_D
*Fully operational code implemented in the x86utm operating system*
https://github.com/plolcott/x86utm
Les messages affichés proviennent d'usenet.