XPost: comp.theory, sci.logic, comp.lang.c++

<Sipser approved abstract>
MIT Professor Michael Sipser has agreed that the following verbatim
paragraph is correct (he has not agreed to anything else in this paper):

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.
</Sipser approved abstract>

to this paper:

*Rebutting the Sipser Halting Problem Proof* https://www.researchgate.net/publication/364302709_Rebutting_the_Sipser_Halting_Problem_Proof

The proof that the simulation of D by H is correct and that this
correctly simulated D would never stop running unless aborted is on page
3 of the above paper. People that fail to comprehend the technical
details of page 3 are unqualified to assess the correctness of page 3.

The technical prerequisites for page 3 are expert knowledge of the C programming language, knowledge of x86 assembly language and how the C
calling conventions are implemented in x86 assembly language.

Page 4 shows the application of a simulating halt decider to the Peter
Linz proof proving that the "impossible" input ⟨Ĥ⟩ ⟨Ĥ⟩ to the embedded
copy of Linz H contained within Linz Ĥ is correctly construed as
specifying non-halting sequence of configurations.

--
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)