Simulating (partial) Halt Deciders Defeat the Halting Problem Proofs

Abstract

A simulating halt decider correctly predicts whether or not its correctly simulated input can possibly reach its own final state and halt. It does this by correctly recognizing several non-halting behavior patterns in a finite number of steps of correct simulation. Inputs that do terminate are simply simulated until they complete.

Categories

Keywords

Reprint years

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Halting problem undecidability and infinitely nested simulation.P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V2).P. Olcott - manuscript
Simulating Halt Decider Applied to the Halting Theorem.P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V4).P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V3).P. Olcott - manuscript
Rebutting the Sipser Halting Problem Proof.P. Olcott - manuscript
Termination Analyzer H is Not Fooled by Pathological Input D.P. Olcott - manuscript
Halting Problem Proof from Finite Strings to Final States.P. Olcott - manuscript
Defining a Decidability Decider for the Halting Problem.P. Olcott - manuscript
Defining a Halting Decidability Decider.P. Olcott - manuscript
Halting problem proofs refuted on the basis of software engineering ?P. Olcott - manuscript
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Halting problem undecidability and infinitely nested simulation (V5).P. Olcott - manuscript
The Halting Problem Is Decidable on a Set of Asymptotic Probability One.Joel David Hamkins & Alexei Miasnikov - 2006 - Notre Dame Journal of Formal Logic 47 (4):515-524.
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown

Analytics

Added to PP
2023-04-12

Downloads
128 (#143,749)

6 months
65 (#75,647)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references