Turing machine-inspired computer science results

Authors:
Juris Hartmanis
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY, United States of America
Venue:
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Year:
2012

Citing 9
Cited 0

Nondeterministic space is closed under complementation

SIAM Journal on Computing
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
On Effective Procedures for Speeding Up Algorithms

Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps

Journal of the ACM (JACM)
A characterization of the power of vector machines

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the power of multiplication in random access machines

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
Hierarchies of memory limited computations

FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses how the Turing machine model directly inspired and guided developments in theoretical computer science. In particular, the Turing machine model was ideal for the creation of computational complexity theory, which has grown into an essential part of theoretical computer science and has found application in other disciplines. The machine operation count was used to define time-bounded computations and the tape squares used defined the tape or memory-bounded computations. The definition and exploration of the corresponding asymptotic complexity classes followed naturally.