XPost: comp.theory, sci.logic, sci.math
*Professor Sipser has agreed to these verbatim words* (*and no more*)
If simulating halt decider H correctly simulates its input D until H
correctly determines that its simulated D would never stop running
unless aborted then H can abort its simulation of D and correctly
report that D specifies a non-halting sequence of configurations.
The above definition of a simulating halt decider applied to this C
function
int Sipser_D(int (*M)())
{
if ( Sipser_H(M, M) )
return 0;
return 1;
}
Using this fully operational software
Complete halt deciding system (Visual Studio Project) Sipser version.
(a) x86utm operating system
(b) x86 emulator adapted from libx86emu to compile under Windows
(c) Several halt deciders and their sample inputs contained within Halt7.c
(d) The execution trace of Sipser_H applied to Sipser_D is shown in Halt7_Sipser.txt
https://liarparadox.org/2022_10_08.zip
Results in Sipser_H correctly determining the halt status of Sipser_D by
this quote of the above criteria:
"H correctly simulates its input D until H correctly determines
that its simulated D would never stop running unless aborted"
This can be verified by carefully studying the first three pages of this
paper. One must be an expert at the C programing language and have some knowledge of assembly language to completely verify the proof.
*Simulating Halt Decider Applied to the Halting Theorem*
https://www.researchgate.net/publication/364302709_Simulating_Halt_Decider_Applied_to_the_Halting_Theorem
--
Copyright 2022 Pete Olcott "Talent hits a target no one else can hit;
Genius hits a target no one else can see." Arthur Schopenhauer
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)