A Note on Universal Turing Machines

&
Journal of Symbolic Logic 35 (4):590-590 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271485

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,448

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

Davis M. D.. A note on universal Turing machines. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 167–175.Davis Martin. The definition of universal Turing machine. Proceedings of the American Mathematical Society, vol. 8 , pp. 1125–1126. [REVIEW]R. J. Nelson - 1970 - Journal of Symbolic Logic 35 (4):590.
Martin Davis. The universal computer. The road from Leibniz to Turing. W. W. Norton & Company, New York and London 2000, xii + 257 pp. [REVIEW]John W. Dawson - 2001 - Bulletin of Symbolic Logic 7 (1):65-66.
El Conocimiento De Un Algoritmo. Martin Davis, La Computadora Universal. De Leibniz A Turing. [REVIEW]María Borges - 2003 - Laguna 12.
Review: Martin Davis, Computability & Unsolvability; Martin Davis, Hilbert's Tenth Problem is Unsolvable. [REVIEW]H. B. Enderton - 1987 - Journal of Symbolic Logic 52 (1):294-294.
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.
Review: Martin Davis, Unsolvable Problems: A Review. [REVIEW]Mary Katherine Yntema - 1968 - Journal of Symbolic Logic 33 (2):297-298.
Review: Martin Davis, Arithmetical Problems and Recursively Enumerable Predicates. [REVIEW]John Myhill - 1953 - Journal of Symbolic Logic 18 (4):341-342.
Review: Martin Davis, Eliminating the Irrelevant from Mechanical Proofs. [REVIEW]J. A. Robinson - 1967 - Journal of Symbolic Logic 32 (1):118-119.
Review: Martin Davis, One Equation to Rule Them all. [REVIEW]H. B. Enderton - 1972 - Journal of Symbolic Logic 37 (3):602-602.

Analytics

Added to PP
2015-02-05

Downloads
21 (#993,219)

6 months
2 (#1,683,984)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (2):149-175.

Add more citations

References found in this work

No references found.

Add more references