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

Links

PhilArchive



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

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.
Algorithmic Information Theory: The Basics.Adam Elga - unknown
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Beyond the universal Turing machine.Jack Copeland - 1999 - Australasian Journal of Philosophy 77 (1):46-67.
Review: Jiri Becvar, A Universal Turing Machine with a Programming Tape. [REVIEW]R. M. Baer - 1971 - Journal of Symbolic Logic 36 (3):535-535.
Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
Super Turing-machines.Jack Copeland - 1998 - Complexity 4 (1):30-32.
Single-tape and multi-tape Turing machines through the lens of the Grossone methodology.Yaroslav Sergeyev & Alfredo Garro - 2013 - Journal of Supercomputing 65 (2):645-663.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
O różnych sposobach rozumienia analogowości w informatyce.Paweł Stacewicz - 2017 - Semina Scientiarum 16:94-115.
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.
Machine humour: examples from Turing test experiments.Huma Shah & Kevin Warwick - 2017 - AI and Society 32 (4):553-561.
Turing's golden: How well Turing's work stands today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
Semantics and symbol grounding in Turing machine processes.Anna Sarosiek - 2017 - Semina Scientiarum 16:211-223.

Analytics

Added to PP
2016-06-30

Downloads
18 (#828,704)

6 months
1 (#1,462,504)

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