Abstract
We compare Random Access Machines with one or two index registers and modifiable or non-modifiable programs and show for a simple problem of data transfer that the more powerful versions are provably more efficient. Our argument uses Kolmogorov complexity.
work supported by DFG, SFB 124, projects B2 and D4
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aandrea, S.O., “On k-tape vesus (k − 1)-tape real-time computation”, pp. 75–96 in Complexity of Computation, ed. R.M. Karp, American Math. Society, Providence, R.I. (1974).
Dietzfelbinger, M., “Lower bounds on computation time for various models in computational complexity theory”, Ph.D. Thesis, University of Illinois at Chicago (1987).
Li, M. and P.M.B. Vitányi, “Tape versus queue and stacks: The lower bounds”, Information & Computation, to appear.
Li, M., L. Longpré and P.M.B. Vitányi, “On the power of the queue”, pp. 219–233 in Structure in Complexity Theory, Lecture Notes in Computer Science (1986).
Li, M. and P.M.B. Vitányi: “Two decades of applied Komogorov complexity”, TR-02-88, Harvard University (1988).
Maass, W. and G. Schnitger, “An optimal lower bound for Turing machines with one work tape and a two-way input tape”, pp. 249–264 in Structure in Complexity Theory, Lecture Notes in Computer Science (1986).
Maass, W., G. Schnitger and E. Szemeredi, “Two tapes are better than one for off-line Turing machines”, Proc. 19th ACM Symposium on Theory of Computing (1987).
Paul, W.J., “On-line simulation of k + 1 tapes by k tapes requires non-linear time”, Information & Control, 1982, pp. 1–8.
Paul, W., “On heads versus tapes”, Theoretical Computer Science 28, pp. 1–12 (1984).
Paul, W.J., J.I. Seifers and J. Simon, “An information theoretic approach to time bounds for on-line computation”, J. Computer and System Sciences 23, pp. 108–126 (1981).
Rabin, M.O., “Real-time Computation”, Israel J. of Math 1, pp. 203–211 (1963).
Reisch, S. and G. Schnitger, “Three applications of Kolmogorov-complexity”, pp. 45–52 in Proc. 23rd IEEE FOCS (1982).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mehlhorn, K., Paul, W.J. (1989). Two versus one index register and modifiable versus non-modifiable programs. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035786
Download citation
DOI: https://doi.org/10.1007/BFb0035786
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51371-1
Online ISBN: 978-3-540-46201-9
eBook Packages: Springer Book Archive