Halting Problem Proof from Finite Strings to Final States

Abstract

If there truly is a proof that shows that no universal halt decider exists on the basis that certain tuples: (H, Wm, W) are undecidable, then this very same proof (implemented as a Turing machine) could be used by H to reject some of its inputs. When-so-ever the hypothetical halt decider cannot derive a formal proof from its input strings and initial state to final states corresponding the mathematical logic functions of Halts(Wm, W) or Loops(Wm, W), halting undecidability has been decided.

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

Defining a Decidability Decider for the Halting Problem.P. Olcott - manuscript
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
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.
Every computably enumerable random real is provably computably enumerable random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.
Kleene's proof of g¨odel's theorem.Peter Smith - unknown
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
On the number of steps in proofs.Jan Kraj\mIček - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Effective inseparability in a topological setting.Dieter Spreen - 1996 - Annals of Pure and Applied Logic 80 (3):257-275.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups.Daniel E. Cohen, Klaus Madlener & Friedrich Otto - 1993 - Mathematical Logic Quarterly 39 (1):143-157.
Erratum.Reuben Hersh - 1998 - Philosophia Mathematica 6 (1):85-85.
Recursive inseparability for residual Bounds of finite algebras.Ralph McKenzie - 2000 - Journal of Symbolic Logic 65 (4):1863-1880.
Analogy and diagonal argument.Zbigniew Tworak - 2006 - Logic and Logical Philosophy 15 (1):39-66.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.

Analytics

Added to PP
2018-02-26

Downloads
625 (#28,166)

6 months
194 (#14,847)

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