Halting problem undecidability and infinitely nested simulation (V2)

Abstract

The halting theorem counter-examples present infinitely nested simulation (non-halting) behavior to every simulating halt decider. Whenever the pure simulation of the input to simulating halt decider H(x,y) never stops running unless H aborts its simulation H correctly aborts this simulation and returns 0 for not halting.

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
Defining a Halting Decidability Decider.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
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
Quantum hypercomputability?Amit Hagar & Alexandre Korolev - 2006 - Minds and Machines 16 (1):87-93.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Equivalence of the Frame and Halting Problems.Eric Dietrich & Chris Fields - 2020 - Algorithms 13 (175):1-9.
Sets, Logic, Computation: An Open Introduction to Metalogic.Richard Zach - 2021 - Open Logic Project.
Dilemmas of Ambiguity and Vagueness.Leon Felkins - 1996
Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.

Analytics

Added to PP
2021-11-10

Downloads
378 (#50,908)

6 months
146 (#21,273)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references