Abstract
Which kind of storage device should be used for a time-efficient simulation of multitape Turing machines on deterministic Turing machines with only one access head? In the literature, simulations on Turing machines accessing a tape, a multidimensional array, or a tree have been studied.
We advocate a new storage device for Turing machines, the “hedge.”
On a Turing machine accessing one hedge, multitape Turing machines can be simulated faster than on each of the traditional storage devices. E.g., we show how to simulate t(n) steps of a multitape Turing machine by O(t(n) log t(n)/log log t(n)) steps of a Turing machine accessing one hedge.
The author gratefully acknowledges the support of Deutsche Forschungsgemeinschaft under Grant Di 412/2-2.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S.A. Cook and S.O. Aanderaa. On the minimum computation time of functions. Transactions of the AMS, 142:294–314, 1969.
M. Dietzfelbinger and M. Hühne. Matching upper and lower bounds for simulations of several tapes on one multidimensional tape. In 14th Conf. on Found. of Software Technology and Theoretical Computer Science, 24–35, 1994.
F.C. Hennie. One-tape, off-line Turing machine computations. Information and Control, 8:553–578, 1965.
A.S. Hodel and M.C. Loui. Optimal dynamic embedding of X-trees into arrays. Theoretical Computer Science, 59:259–276, 1988.
J. Hopcroft, W.J. Paul, and L. Valiant. On time versus space and related problems. In Proc. 16th Symp. on Found. of Computer Science, 57–64, 1975.
J. Hartmanis and R.E. Stearns. On the computational complexity of algorithms. Transactions of the AMS, 117:285–306, 1965.
M.C. Loui. Minimizing access pointers into trees and arrays. Journal of Computer and System Sciences, 28:359–378, 1984.
W. Maass. Combinatorial lower bound arguments for deterministic and non-deterministic Turing machines. Transactions of the AMS, 292:675–693, 1985.
N. Pippenger and M.J. Fischer. Relations among complexity measures. Journal of the ACM, 26:361–381, 1979.
W.J. Paul and K.R. Reischuk. On time versus space II. Journal of Computer and System Sciences, 22:312–327, 1981.
K.R. Reischuk. A fast implementation of a multidimensional storage into a tree storage. Theoretical Computer Science, 19:253–266, 1982.
K.R. Reischuk. Einführung in die Komplexitätstheorie. B.G. Teubner, Stuttgart, 1990.
A. Schönhage. Storage modification machines. SIAM J. on Computing, 9:490–508, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hühne, M. (1995). The hedge: An efficient storage device for Turing machines with one head. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_131
Download citation
DOI: https://doi.org/10.1007/3-540-60246-1_131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60246-0
Online ISBN: 978-3-540-44768-9
eBook Packages: Springer Book Archive