The hedge: An efficient storage device for Turing machines with one head

Extended abstract
  • Martin Hühne
Contributed Papers Graphs in Models of Computations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


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.


Storage Device Turing Machine Data Track Meeting Place Simulation Track 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CA69]
    S.A. Cook and S.O. Aanderaa. On the minimum computation time of functions. Transactions of the AMS, 142:294–314, 1969.Google Scholar
  2. [DH94]
    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.Google Scholar
  3. [Hen65]
    F.C. Hennie. One-tape, off-line Turing machine computations. Information and Control, 8:553–578, 1965.CrossRefGoogle Scholar
  4. [HL88]
    A.S. Hodel and M.C. Loui. Optimal dynamic embedding of X-trees into arrays. Theoretical Computer Science, 59:259–276, 1988.Google Scholar
  5. [HPV75]
    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.Google Scholar
  6. [HS65]
    J. Hartmanis and R.E. Stearns. On the computational complexity of algorithms. Transactions of the AMS, 117:285–306, 1965.Google Scholar
  7. [Lou84]
    M.C. Loui. Minimizing access pointers into trees and arrays. Journal of Computer and System Sciences, 28:359–378, 1984.Google Scholar
  8. [Maa85]
    W. Maass. Combinatorial lower bound arguments for deterministic and non-deterministic Turing machines. Transactions of the AMS, 292:675–693, 1985.Google Scholar
  9. [PF79]
    N. Pippenger and M.J. Fischer. Relations among complexity measures. Journal of the ACM, 26:361–381, 1979.Google Scholar
  10. [PR81]
    W.J. Paul and K.R. Reischuk. On time versus space II. Journal of Computer and System Sciences, 22:312–327, 1981.Google Scholar
  11. [Rei82]
    K.R. Reischuk. A fast implementation of a multidimensional storage into a tree storage. Theoretical Computer Science, 19:253–266, 1982.Google Scholar
  12. [Rei90]
    K.R. Reischuk. Einführung in die Komplexitätstheorie. B.G. Teubner, Stuttgart, 1990.Google Scholar
  13. [Sch80]
    A. Schönhage. Storage modification machines. SIAM J. on Computing, 9:490–508, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Martin Hühne
    • 1
  1. 1.Fachbereich Informatik, Lehrstuhl IIUniversität DortmundDortmund

Personalised recommendations