Review: E. F. Moore, A Simplified Universal Turing Machine [Book Review]

Journal of Symbolic Logic 19 (1):57-58 (1954)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

A Simplified Universal Turing Machine.E. F. Moore - 1954 - Journal of Symbolic Logic 19 (1):57-58.
Shannon Claude E.. A universal Turing machine with two internal states. Automata studies, edited by Shannon C. E. and McCarthy J., Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton 1956, pp. 157–165. [REVIEW]Patrick C. Fischer - 1971 - Journal of Symbolic Logic 36 (3):532.
Nelson Raymond J.. Simplest normal truth functions. [REVIEW]Robert McNaughton - 1956 - Journal of Symbolic Logic 21 (3):328-330.
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.
Nelson Raymond J.. Weak simplest normal truth functions.Robert McNaughton - 1956 - Journal of Symbolic Logic 21 (3):330-331.
A Universal Turing Machine with Two Internal States.Claude E. Shannon - 1971 - Journal of Symbolic Logic 36 (3):532-532.
Shannon Claude E. and Moore Edward F.. Machine aid for switching circuit design. Proceedings of the I.R.E., vol. 41 , pp. 1348–1351. [REVIEW]Alonzo Church - 1954 - Journal of Symbolic Logic 19 (2):141-141.
Review: K. de Leeuw, E. F. Moore, C. E. Shannon, N. Shapiro, Computability by Probabilistic Machines. [REVIEW]Patrick C. Fischer - 1970 - Journal of Symbolic Logic 35 (3):481-482.
F. C. Hennie. One-tape, off-line Turing machine computations. Information and control, vol. 8 , pp. 553–578.Jiří Bečvář - 1968 - Journal of Symbolic Logic 33 (1):119-120.
Andrew Hodges. Alan Turing and the Turing machine. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 3–15. - Stephen C. Kleene. Turing's analysis of computahility, and major applications of it. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 17–54. - Robin Gandy. The confluence of ideas in 1936. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 55–111. - Solomon Feferman. Turing in the land of O. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 113–147. - Martin Davis. Mathematica. [REVIEW]John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.

Analytics

Added to PP
2013-11-03

Downloads
15 (#1,229,929)

6 months
4 (#1,246,333)

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