Halting problem undecidability and infinitely nested simulation (V5)

Abstract

This is an explanation of a key new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. To fully understand this paper a software engineer must be an expert in the C programming language, the x86 programming language, exactly how C translates into x86 and what an x86 process emulator is. No knowledge of the halting problem is required.

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 (V2).P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation.P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V3).P. Olcott - manuscript
Defining a Halting Decidability Decider.P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V4).P. Olcott - manuscript
Halting Problem Proof from Finite Strings to Final States.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
Defining a Decidability Decider for the Halting Problem.P. Olcott - manuscript
Quantum hypercomputability?Amit Hagar & Alexandre Korolev - 2006 - Minds and Machines 16 (1):87-93.
Equivalence of the Frame and Halting Problems.Eric Dietrich & Chris Fields - 2020 - Algorithms 13 (175):1-9.
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
Buttresses of the Turing Barrier.Paolo Cotogno - 2015 - Acta Analytica 30 (3):275-282.
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Setting the scene: The claim and the issues.Roger Penrose - 1993 - In Donald Eric Broadbent (ed.), The Simulation of human intelligence. Cambridge: Blackwell.

Analytics

Added to PP
2022-04-22

Downloads
201 (#101,507)

6 months
82 (#60,440)

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