Marvin L. Minsky. Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing machines. Annals of mathematics, second series, vol. 74 , pp. 437–455 [Book Review]

Journal of Symbolic Logic 31 (4):654-655 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1997

DOI

10.2307/2269716

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,752

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Recursive Unsolvability of Post's Problem of "Tag" and other Topics in the Theory of Turing Machines.Marvin L. Minsky - 1966 - Journal of Symbolic Logic 31 (4):654-655.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions.Martin Davis (ed.) - 1965 - Hewlett, NY, USA: Dover Publication.
M. L. Minsky. Size and structure of universal Turing machines using Tag systems. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 229–238. [REVIEW]Martin Davis - 1966 - Journal of Symbolic Logic 31 (4):655-655.
Turing oracle machines, online computing, and three displacements in computability theory.Robert I. Soare - 2009 - Annals of Pure and Applied Logic 160 (3):368-399.
Kleene S. C. and Post Emil L.. The upper semi-lattice of degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 59 , pp. 379–407. [REVIEW]Hartley Rogers - 1956 - Journal of Symbolic Logic 21 (4):407-408.
Spector Clifford. On degrees of recursive unsolvability. Annals of mathematics, ser. 2 vol. 64 , pp. 581–592.Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):374-375.
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Post’s Problem for ordinal register machines: An explicit approach.Joel David Hamkins & Russell G. Miller - 2009 - Annals of Pure and Applied Logic 160 (3):302-309.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Post's Problem for Reducibilities of Bounded Complexity.Valeriy K. Bulitko - 2002 - Mathematical Logic Quarterly 48 (3):367-373.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
The possible turing degree of the nonzero member in a two element degree spectrum.Valentina S. Harizanov - 1993 - Annals of Pure and Applied Logic 60 (1):1-30.

Analytics

Added to PP
2013-11-03

Downloads
38 (#417,943)

6 months
6 (#510,793)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references