DD is to be construed as a finite string of C source code of
a C function. HHH is to be construed as a C interpreter that
simulates C source code. HHH can simulate itself simulating
DD if needed.
typedef int (*ptr)();
int HHH(ptr P);
01 int DD()
02 {
03 int Halt_Status = HHH(DD);
04 if (Halt_Status)
05 HERE: goto HERE;
06 return Halt_Status;
07 }
08
09 void main()
10 {
11 HHH(DD);
12 }
*the C portion of my halting theorem refutation*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
*ENTAILS next step*
This mathematical induction proof of non-termination
simulation invariant:
*DD simulated by HHH does not halt while being simulated*
as formal proof of non-termination of DD while DD is being
simulated by HHH.
DD is to be construed as a finite string of C source code of
a C function. HHH is to be construed as a C interpreter that
simulates C source code. HHH can simulate itself simulating
DD if needed.
typedef int (*ptr)();
int HHH(ptr P);
01 int DD()
02 {
03-a-a int Halt_Status = HHH(DD);
04-a-a if (Halt_Status)
05-a-a-a-a HERE: goto HERE;
06-a-a return Halt_Status;
07 }
08
09 void main()
10 {
11-a HHH(DD);
12 }
*the C portion of my halting theorem refutation*
There does not exist any implementation of C function HHH
that simulates C function DD according to the operational
semantics of C such that the simulated C function DD reaches
its own simulated return statement in any N finite number of
steps.
*ENTAILS next step*
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 54:13:48 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,449 |