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.

Analytics

Added to PP
2023-04-12

Downloads
270 (#76,780)

6 months
113 (#44,320)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?