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 [Book Review]

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1997

DOI

10.2307/2269717

Links

PhilArchive



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

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

J. C. E. Dekker. Infinite series of isols. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 77–96. [REVIEW]Kenneth Appel - 1966 - Journal of Symbolic Logic 31 (4):652-652.
W. V. Quine. Logic as a source of syntactical insights. Structure of language and its mathematical aspects, Proceedings of symposia in applied mathematics, vol. 12, American Mathematical Society, Providence 1961, pp. 1–5. - Irina Lynch, W. V. Quine. Comments. Structure of language and its mathematical aspects, Proceedings of symposia in applied mathematics, vol. 12, American Mathematical Society, Providence 1961, pp. 254–255. [REVIEW]Ann M. Singleterry - 1966 - Journal of Symbolic Logic 31 (3):496-497.
Review: M. L. Minsky, Size and Structure of Universal Turing Machines using Tag Systems. [REVIEW]Martin Davis - 1966 - Journal of Symbolic Logic 31 (4):655-655.
Abernathy Robert. The problem of linguistic equivalence. Structure of language and its mathematical aspects, Proceedings of symposia in applied mathematics, vol. 12, American Mathematical Society, Providence 1961, pp. 95–98. [REVIEW]L. Jonathan Cohen - 1966 - Journal of Symbolic Logic 31 (4):668-668.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions.Martin Davis (ed.) - 1965 - Hewlett, NY, USA: Dover Publication.
On Some Properties of Humanly Known and Humanly Knowable Mathematics.Jason L. Megill, Tim Melvin & Alex Beal - 2014 - Axiomathes 24 (1):81-88.
Castor quadruplorum.Arnold Oberschelp, Karsten Schmidt-Göttsch & Günter Todt - 1988 - Archive for Mathematical Logic 27 (1):35-44.
The heuristic function of mathematics in physics and astronomy.Stojan Obradović & Slobodan Ninković - 2009 - Foundations of Science 14 (4):351-360.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
Review: M. D. Davis, A Note on Universal Turing Machines; Martin Davis, The Definition of Universal Turing Machine. [REVIEW]R. J. Nelson - 1970 - Journal of Symbolic Logic 35 (4):590-590.

Analytics

Added to PP
2014-03-30

Downloads
66 (#241,176)

6 months
6 (#504,917)

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