Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Becvár (1965)
Real-time and complexity problems in automata theoryKybernetika, 1
F. Hennie (1965)
One-Tape, Off-Line Turing Machine ComputationsInf. Control., 8
CONSTABLE R.L. (1969)
20
P. Fischer, J. Hartmanis, M. Blum (1968)
Tape Reversal Complexity Hierarchies
Giovanni Pighizzini (1965)
Crossing sequences and off-line Turing machine computations
J. Hopcroft, J. Ullman (1968)
Relations Between Time and Tape ComplexitiesJ. ACM, 15
F. Hennie, R. Stearns (1966)
Two-Tape Simulation of Multitape Turing MachinesJ. ACM, 13
H. Yamada (1962)
Real-Time Computation and Recursive Functions Not Real-Time ComputableIRE Trans. Electron. Comput., 11
L. Landweber, E. Robertson (1972)
Recursive Properties of Abstract Complexity ClassesJournal of the ACM (JACM), 19
R. Constable (1969)
The Operator Gap
(1970)
A bibliography on computational complexity. Res. Rep. CSRR
J. Hartmanis, R. Stearns (1965)
On the Computational Complexity of AlgorithmsTransactions of the American Mathematical Society, 117
P. Fischer (1965)
Multi-tape and infinite-state automata—a surveyCommunications of the ACM, 8
Information Processing Letters
Bill Broyles (1898)
BibliographyThe Journal of Laryngology, Rhinology, and Otology, 13
A. Cobham (1968)
On the Hartmanis-Stearns Problem for a Class of TAG Machines
Rózsa Péter (1955)
Review: Andrzej Grzegorczyk, Some Classes of Recursive FunctionsJournal of Symbolic Logic, 20
BECVAR J (1965)
475Kybernetika, 1
F. Lewis (1970)
Unsolvability considerations in computational complexityProceedings of the second annual ACM symposium on Theory of computing
A. Meyer, D. Ritchie (1967)
The complexity of loop programsProceedings of the 1967 22nd national conference
R. Stearns, J. Hartmanis, P. Lewis (1965)
Hierarchies of memory limited computations
J.
Tape-Reversal Bounded Turing Machine Computations *
BORODIN A. (1969)
7
R. Karp (1967)
Some Bounds on the Storage Requirements of Sequential Machines and Turing MachinesJ. ACM, 14
P. Young (1968)
Toward a Theory of Enumerations
(1961)
Journal of the Association for Computing MachineryNature, 190
A. Borodin (1969)
Complexity Classes of Recursive Functions and the Existence of Complexity Gaps
(1969)
Turing computations with logorithmie delay
M. Blum (1967)
On the Size of MachinesInf. Control., 11
M. Rabin (1960)
Degree of difficulty of computing a function and a partial ordering of recursive setsCTIT technical reports series
W. Savitch (1969)
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)Proceedings of the first annual ACM symposium on Theory of computing
R. Constable (1969)
Upward and Downward Diagonalization over Axiomatic Complexity Classes
(1966)
J. ACM
(1967)
Complexity of algorithms and computations. Course Notes
A. Grzegorczyk (1964)
Some classes of recursive functions
M. Rabin (1963)
Real time computationIsrael Journal of Mathematics, 1
J. Hopcroft, J. Ullman (1969)
Some Results on Tape-Bounded Turing MachinesJ. ACM, 16
A. Borodin, R. Constable, J. Hopcroft (1969)
Dense and Non-Dense Families of Complexity Classes
S. Cook (1969)
Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of FunctionsJournal of Symbolic Logic, 34
P. Fischer (1968)
The Reduction of Tape Reversals for Off-Line One-Tape Turing MachinesJ. Comput. Syst. Sci., 2
BLUM N. (1969)
43
R. Ritchie (1963)
CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONSTransactions of the American Mathematical Society, 106
E. McCreight, A. Meyer (1969)
Classes of computable functions defined by bounds on computation: Preliminary ReportProceedings of the first annual ACM symposium on Theory of computing
COBHAM A. (1968)
51
P. Axt (1963)
Enumeration and the Grzegorczyk HierarchyMathematical Logic Quarterly, 9
M. Blum (1967)
A Machine-Independent Theory of the Complexity of Recursive FunctionsJ. ACM, 14
J. Hartmanis (1968)
Computational Complexity of One-Tape Turing Machine ComputationsJ. ACM, 15
M. Blum (1971)
On Effective Procedures for Speeding Up AlgorithmsJ. ACM, 18
P. Lewis, R. Stearns, J. Hartmanis (1965)
Memory bounds for recognition of context-free and context-sensitive languages
An Overview of the Theory of Computational Complexity J. HARTMANIS AND J. E. HOPCROFT Cornell University,* Ithaca, New York ABSTRACT. The purpose of this paper is to outline the theory of computational complexity which has emerged as a comprehensive theory during the last decade. This theory is concerned with the quantitative aspects of computations and its central theme is the measuring of the difficulty of computing functions. The paper concentrates on the study of computational complexity measures defined for all computable functions and makes no attempt to survey the whole field exhaustively nor to present the material in historical order. Rather it presents the basic concepts, results, and techniques of computational complexity from a new point of view from which the ideas are more easily understood and fit together as a coherent whole. KEY WORDS AND PHRASES: computational complexity, complexity axioms, complexity measures, computation speed, time-bounds, tape-bounds, speed-up, Turing machines, diagonalization, length of programs 5.20, 5.22, 5.23, 5.24 CR C A T E G O R I E S : 1. Introduction I t is clear that a viable theory of computation must deal realistically with the quantitative aspects of computing and must develop a general theory which
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Jul 1, 1971
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.