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 [Book Review]

Journal of Symbolic Logic 39 (1):188-189 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272383

Links

PhilArchive



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

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

Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata.Oscar H. Ibarra - 1974 - Journal of Symbolic Logic 39 (1):188-189.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
Super Turing-machines.Jack Copeland - 1998 - Complexity 4 (1):30-32.
Infinite time Turing machines.Joel David Hamkins - 2002 - Minds and Machines 12 (4):567-604.
Infinite time Turing machines.Joel David Hamkins & Andy Lewis - 2000 - Journal of Symbolic Logic 65 (2):567-604.
Some thoughts on Akin's spiteful computer.Ben Goertzel - 1994 - Minds and Machines 4 (1):75-80.
Supermachines and superminds.Eric Steinhart - 2003 - Minds and Machines 13 (1):155-186.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
The computational strengths of α-tape infinite time Turing machines.Benjamin Rin - 2014 - Annals of Pure and Applied Logic 165 (9):1501-1511.
On Alan Turing's anticipation of connectionism.Jack Copeland - 1996 - Synthese 108 (3):361-377.
Quantum speed-up of computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
Fellow of Merton College, Oxford.J. R. Lucas - unknown
Review: R. Frejvald, Complexity of Recognition of Symmetry on Turing Machines with Input; A. M. Barzdin, Complexity of Recognition of Symmetry on Turing Machines. [REVIEW]Albert A. Mullin - 1970 - Journal of Symbolic Logic 35 (1):159-159.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.

Analytics

Added to PP
2013-11-03

Downloads
22 (#669,532)

6 months
16 (#138,396)

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