Halting problem proofs refuted on the basis of software engineering ?

Abstract

This is an explanation of a possible new insight into the halting problem provided in the language of software engineering. Technical computer science terms are explained using software engineering terms. No knowledge of the halting problem is required. It is based on fully operational software executed in the x86utm operating system. The x86utm operating system (based on an excellent open source x86 emulator) was created to study the details of the halting problem proof counter-examples at the much higher level of abstraction of C/x86.

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 (V5).P. Olcott - manuscript
Defining a Halting Decidability Decider.P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V3).P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation (V2).P. Olcott - manuscript
Halting problem undecidability and infinitely nested simulation.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
Equivalence of the Frame and Halting Problems.Eric Dietrich & Chris Fields - 2020 - Algorithms 13 (175):1-9.
Effective inseparability in a topological setting.Dieter Spreen - 1996 - Annals of Pure and Applied Logic 80 (3):257-275.
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Quantum hypercomputability?Amit Hagar & Alexandre Korolev - 2006 - Minds and Machines 16 (1):87-93.
Defining a Decidability Decider for the Halting Problem.P. Olcott - manuscript

Analytics

Added to PP
2022-07-02

Downloads
332 (#58,374)

6 months
91 (#45,080)

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