F. C. Hennie. One-tape, off-line Turing machine computations. Information and control, vol. 8 , pp. 553–578

Journal of Symbolic Logic 33 (1):119-120 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270083

Other Versions

No versions found

Links

PhilArchive



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

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

Review: F. C. Hennie, One-Tape, Off-Line Turing Machine Computations. [REVIEW]Jiri Becvar - 1968 - Journal of Symbolic Logic 33 (1):119-120.
One-Tape, Off-Line Turing Machine Computations.F. C. Hennie - 1968 - Journal of Symbolic Logic 33 (1):119-120.
Bečvář Jiří. A universal Turing machine with a programming tape. Colloquium on the Foundations of Mathematics, Mathematical Machines and Their Applications, Tihany, 11–15 September 1962, edited by Kalmár László, Akadémiai Kiadó, Budapest 1965, pp. 11–20. [REVIEW]R. M. Baer - 1971 - Journal of Symbolic Logic 36 (3):535-535.
Bečvář Jiří. Real-time and complexity problems in automata theory. English with Czech summary. Kybernetika , vol. 1 , pp. 475–498. [REVIEW]Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):346-346.
Hartmanis J.. Context-free languages and Turing machine computations. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence 1967, pp. 42–51. [REVIEW]S. Ginsburg - 1972 - Journal of Symbolic Logic 37 (4):759-759.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
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.
Context-free Languages and Turing Machine Computations.J. Hartmanis - 1972 - Journal of Symbolic Logic 37 (4):759-759.

Analytics

Added to PP
2016-06-30

Downloads
26 (#849,392)

6 months
6 (#851,951)

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