Sujet : Re: D(D) simulated by H cannot possibly reach past its own line 03
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory sci.logicDate : 04. May 2024, 00:42:57
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v13p9h$phf4$1@dont-email.me>
References : 1
User-Agent : Mozilla Thunderbird
On 5/3/2024 8:40 AM, olcott wrote:
00 int H(ptr x, ptr x) // ptr is pointer to int function
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.
Since everyone is denying these facts on the basis that no one
here has a clue about what execution traces are and how they work
it makes no sense to go to the next step.
(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
-- Copyright 2024 Olcott "Talent hits a target no one else can hit; Geniushits a target no one else can see." Arthur Schopenhauer