Time-bounded random access machines

Authors:
Stephen A. Cook;Robert A. Reckhow
Affiliations:
-;-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 2
Cited 3

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
Formal languages and their relation to automata

Formal languages and their relation to automata

On using of random access machine simulators in teaching of theoretical computer science

CompSysTech '09 Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing
Research paper: The saga of minimum spanning trees

Computer Science Review
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a formal model for random access computers and argue that the model is a good one to use in the theory of computational complexity. Results are proved which compare run times for recognizing sets using this model (which has a fixed program) with a stored program model and with Turing machines. The main result, theorem 3, shows the existence of a time complexity hierarchy which is finer than that of any standard abstract computer model. An Algol-like programming language is introduced which facilitates proofs of the theorems.