XPost: comp.theory, sci.logic, sci.math

On 7/11/2022 2:25 PM, dklei...@gmail.com wrote:

On Monday, July 11, 2022 at 7:58:52 AM UTC-7, olcott wrote:

Only an ordinary understanding of C and software engineering is required.

int H(ptr p, ptr i); // simulating halt decider

H Simulates its input until it correctly predicts that this simulated
input would never terminate normally then rejects this input as non-halting. >>

Which is not the classical Turning Machine question.

*Once this halt deciding principle is accepted*
A halt decider must compute the mapping from its inputs to an accept or
reject state on the basis of the actual behavior that is actually
specified by these inputs.

*Then (by logical necessity) this is understood to implement that*
Every simulating halt decider that correctly simulates its input until
it correctly predicts that this simulated input would never reach its
final state, correctly rejects this input as non-halting.

*Halting problem proofs refuted on the basis of software engineering* https://www.researchgate.net/publication/361701808_Halting_problem_proofs_refuted_on_the_basis_of_software_engineering



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