Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/ios-press/solvability-of-the-halting-and-reachability-problem-for-binary-2-tag-b0FPrmg0q1
References (34)
-
L. Mol (2007)
Study of Limits of Solvability in Tag Systems -
D. Woods, Turlough Neary (2006)
On the time complexity of 2-tag systems and small universal Turing machines2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
-
Martin Davis (1982)
Why Gödel Didn't Have Church's ThesisInf. Control., 54
-
Turlough Neary
Small polynomial time universal Turing machines -
M. Minsky (1961)
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 74
-
Hao Wang (1963)
Tag systems and lag systemsMathematische Annalen, 152
-
Emil Post, Martin Davis (1994)
Solvability, provability, definability: the collected works of Emil L. Post -
J. Cocke, M. Minsky (1964)
Universality of Tag Systems with P = 2J. ACM, 11
-
J. Stillwell (2004)
Emil Post and His Anticipation of Gödel and TuringMathematics Magazine, 77
-
L. Mol (2008)
Tag systems and Collatz-like functionsTheor. Comput. Sci., 390
-
Emil Post (1947)
Recursive Unsolvability of a problem of ThueJournal of Symbolic Logic, 12
-
L. Mol (2007)
Tracing unsolvability : a mathematical, historical and philosophical analysis with a special focus on tag systems -
M. Margenstern (2000)
Frontier between decidability and undecidability: a surveyTheor. Comput. Sci., 231
-
C. Baiocchi (2001)
Three Small Universal Turing Machines -
Emil Post (1946)
A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 52
-
D. Woods, Turlough Neary (2007)
Small Semi-Weakly Universal Turing Machines -
A. Turing (1937)
On computable numbers, with an application to the EntscheidungsproblemProc. London Math. Soc., s2-42
-
the results of this paper prove that the class TS(2,2) cannot be universal in the standard sense as the system must have an unsolvable halting problem -
A. Turing (1938)
On Computable Numbers, with an Application to the Entscheidungsproblem. A CorrectionProceedings of The London Mathematical Society
-
Solvability of the halting and reachability problem for binary 2-tag systems -
(1962)
Size and Structure of Universal Turing Machines using Tag systems: a 4-symbol 7-state machine -
(1971)
On E. L. Post’s ‘Tag’ Problem. (Russian), Trudy Matematicheskogo Instituta imeni V.A. Steklova , (72), 1964b, 5–56, English translation -
L. Mol (2006)
Closing the Circle: An Analysis of Emil Post's Early WorkBull. Symb. Log., 12
-
A. Church (1936)
An Unsolvable Problem of Elementary Number TheoryAmerican Journal of Mathematics, 58
-
K. Wohl, J. Wisniak (2002)
His life and work -
Liesbeth Mol (2006)
Closing the Circle: An Analysis of Emil Post's Early WorkBulletin of Symbolic Logic, 12
-
(1964)
Post's 'Tag' Problem. (Russian) -
(1947)
On the impossibility of certain algorithms in the theory of associative systems (Russian) -
If false, this could imply that there is weak universality in the class TS -
Turlough Neary, D. Woods (2007)
Four Small Universal Turing Machines -
John Andreae (1998)
Universal Turing Machine -
Emil Post (1943)
Formal Reductions of the General Combinatorial Decision ProblemAmerican Journal of Mathematics, 65
-
Matthew Cook (2004)
Universality in Elementary Cellular AutomataComplex Syst., 15
-
(1965)
Absolutely unsolvable problems and relatively undecidable propositions -Account of an anticipation
- Publisher
- IOS Press
- Copyright
- Copyright © 2010 by IOS Press, Inc
- ISSN
- 0169-2968
- eISSN
- 1875-8681
- DOI
- 10.3233/FI-2010-257
- Publisher site
- See Article on Publisher Site
Abstract
In this paper a detailed proofwill be given of the solvability of the halting and reachability problem for binary 2-tag systems.
Journal
Fundamenta Informaticae – IOS Press
Published: Jan 1, 2010