Abstract
In this paper we explore the computational complexity measure defined by running times of programs on random access stored program machines, RASP's. The purpose of this work is to study more realistic complexity measures and to provide a setting and some techniques to explore different computer organizations. The more interesting results of this paper are obtained by an argument about the size of the computed functions. For example, we show (without using diagonalization) that there exist arbitrarily complex functions with optimal RASP programs whose running time cannot be improved by any multiplicative constant. We show, furthermore, that these optimal programs cannot be fixed procedures and determine the difference in computation speed between fixed procedures and self-modifying programs. The same technique is used to compare computation speed of machines with and without built-in multiplication. We conclude the paper with a look at machines with associative memory and distributed logic machines.
Similar content being viewed by others
References
C. C. Elgot andA. Robinson, Random-access stored-program machines, an approach to programming languages,J. Assoc. Comput. Mach. 11 (1964), 365–399.
S. A. Cook, Computational complexity using random access machines, Course Notes, University of California, Berkeley, 1970.
J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285–306.
J. Hartmanis, Computational complexity of one-tape Turing machine computations,J. Assoc. Comput. Mach. 15 (1968), 325–339.
J. Hartmanis, Tape reversal bounded Turing machine computations,J. Comput. System Sci. 2 (1968), 117–135.
P. C. Fischer, J. Hartmanis andM. Blum, “Tape Reversal Complexity Hierarchies”, IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, (1968), pp. 373–382.
M. O. Rabin, Real-time computation,Israel J. Math. 1 (1964), 203–211.
F. C. Hennie, One-tape, off-line Turing machine computations,Information and Control 8 (1965), 553–578.
F. C. Hennie andR. E. Stearns, Two-tape simulation of multi-tape Turing machines,J. Assoc. Comput. Mach. 13 (1966), 533–546.
M. Blum, A machine-independent theory of the complexity of recursive functions,J. Assoc. Comput. Mach. 14 (1967), 322–336.
A. Borodin, “Complexity Classes of Recursive Functions and the Existence of Complexity Gaps”, Conference Record of ACM Symposium on Theory of Computing, 1969, pp. 67–78.
E. M. McCreight andA. R. Meyer, “Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report”, Conference Record of ACM Symposium on Theory of Computing, 1969, pp. 79–88.
Author information
Authors and Affiliations
Additional information
This research has been supported in part by National Science Foundation Grant GJ-155.
Rights and permissions
About this article
Cite this article
Hartmanis, J. Computational complexity of random access stored program machines. Math. Systems Theory 5, 232–245 (1971). https://doi.org/10.1007/BF01694180
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01694180