Advertisement

A "fast implementation" of a multidimensional storage into a tree storage

  • Rüdiger Reischuk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

Abstract

Every multidimensional Turing-machine can be simulated on-line by a tree-tape Turing-machine in nearly the same amount of time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cook and Anderaa, On the minimum computation time of functions, Trans. AMS 142, August 1969, 291–314.Google Scholar
  2. 2.
    Fischer, Meyer and Rosenberg, Real-time simulation of multihead tape units, J. ACM 19, 4, 1972, 590–607.Google Scholar
  3. 3.
    Grigorjev, Imbedding theorems for Turing-machines of differnet dimensions and Kolmogorov's algorithms, Soviet Math. Dokl. 18, 1977, 588–592.Google Scholar
  4. 4.
    Grigorjev, Time bounds of multidimensional Turing-machines, 1979.Google Scholar
  5. 5.
    Hennie, On-line Turing machine computations, IEEE Trans. EC 15, 1, 1966, 34–44.Google Scholar
  6. 6.
    Hennie and Stearns, Two-tape simulation of multihead tape units, I. ACM 13, 4, 1966, 533–546.Google Scholar
  7. 7.
    Leong and Seiferas, New real-time simulations of multihead tape units, Proc. 9th ACM Symp. Theory of Computing, 1977, 239–248.Google Scholar
  8. 8.
    Paterson, Fischer and Meyer, An improved overlap argument for on-line multiplication, SIAM-AMS Proc. 7, 1974, 97–111.Google Scholar
  9. 9.
    Paul and Reischuk, On time versus space II, 20th IEEE-FOCS, 1979, 298–306.Google Scholar
  10. 10.
    Pippenger and Fischer, Relations among complexity measures, J. ACM 26, 2, 1979, 361–381.Google Scholar
  11. 11.
    Reischuk, Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur, Preprint, Universität Bielefeld, 1979.Google Scholar
  12. 12.
    Stoss, Zwei-Band Simulation von Turingmaschinen, Computing 7, 1971, 222–235.Google Scholar
  13. 13.
    Turing, On computable numbers with an application to the Entscheidungsporblem, Proc. London Math. Soc. (2), 42, 1936, 230–265.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Rüdiger Reischuk
    • 1
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeld 1Germany

Personalised recommendations