Yurii Rogozhin. Small universal Turing machines. Theoretical Computer Science, vol. 168 , pp. 215–240

Bulletin of Symbolic Logic 9 (3):414-414 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600004492

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

Small Universal Turing Machines.Yurii Rogozhin - 2003 - Bulletin of Symbolic Logic 9 (3):414-414.
Anna R. Bruss and Albert R. Meyer. On time-space classes and their relation to the theory of real addition. Theoretical computer science, vol. 11 , pp. 59–69. - Leonard Berman. The complexity of logical theories. Theoretical computer science, pp. 71–77. - Hugo Volger. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories. Theoretical computer science, vol. 23 , pp. 333–337. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
Corrado Böhm. On a family of Turing machines and the related programming language. ICC bulletin, vol. 3 , pp. 185–194.Martin Davis - 1966 - Journal of Symbolic Logic 31 (1):140-140.
N. V. Bélákin. Mašiny T′uringa, rabotaúščié na ploskosti. Doklady Akadémii Nauk SSSR, vol. 168 , pp. 502–503. - N. V. Beljakin. Turing machines operating on a plane. English translation of the preceding by L. Ebner. Soviet mathematics, vol. 7 no. 3 , pp. 661–662. [REVIEW]Patrick C. Fischer - 1968 - Journal of Symbolic Logic 33 (3):469.
Gitik Moti. The strength of the failure of the singular cardinal hypothesis. Annals of pure and applied logic, vol. 51 , pp. 215–240. [REVIEW]James Cummings - 1995 - Journal of Symbolic Logic 60 (1):340-340.
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.
Ibarra Oscar H.. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. Journal of computer and system sciences, vol. 5 , pp. 88-117. [REVIEW]Walter J. Savitch - 1974 - Journal of Symbolic Logic 39 (1):188-189.
Stéphane Demri, Valentin Goranko, and Martin Lange, Temporal Logics in Computer Science: Finite-state Systems, Cambridge Tracts in Theoretical Computer Science, vol. 58, Cambridge University Press, Cambridge, 2016, viii + 744 pp. [REVIEW]Kamal Lodaya - 2017 - Bulletin of Symbolic Logic 23 (2):203-204.
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.
A Note on Universal Turing Machines.M. D. Davis & Martin Davis - 1970 - Journal of Symbolic Logic 35 (4):590-590.

Analytics

Added to PP
2014-03-22

Downloads
42 (#524,997)

6 months
19 (#148,297)

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