Skip to main content
SpringerLink
Log in

Some time-space bounds for one-tape deterministic turing machines

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 380))

Included in the following conference series:

  • 158 Accesses

Abstract

Every single-tape deterministic Turing machine (DTM) of time complexity T(n)≥n 2 can be simulated by a single-tape DTM in space T 1/2(n). It is shown that the time of the simulation can be bounded by T 3/2(n). Similar results are shown for offline machines and for machines with multidimensional tape.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.M. Adleman and M.C. Loui, Space-bounded simulation of multitape Turing machines, Math. Systems Theory, 14 (1980), 215–222.

    Article  Google Scholar 

  2. J.E. Hopcroft, W.J. Paul and L.G. Valiant, On time versus space, J. Assoc. Comput. Mach., 24 (1977), 332–337.

    Google Scholar 

  3. O.H. Ibarra and S. Moran, Some time-space tradeoff results concerning single-tape and offline TM's, SIAM J. Comput., 12 (1983), 388–394.

    Article  Google Scholar 

  4. S. Kurtz and W. Maass, Some time, space and reversal tradeoffs, Conf. Comput. Complexity Theory, March 21–25, 1983, Santa Barbara, pp. 30–40.

    Google Scholar 

  5. K. Loryś and M. Liśkiewicz, Two applications of Fürer's counter to one-tape nondeterministic TMs, in Mathematical Foundations of Computer Science, Ed. by M.P. Chytil, L. Janiga and V. Koubek, LNCS 324, Springer-Verlag, Berlin 1988, pp. 445–453.

    Google Scholar 

  6. M.C. Loui, A space bound for one-tape multidimensional Turing machines, Theoret. Comput. Sci., 15 (1981), 311–320.

    Article  Google Scholar 

  7. M.S. Paterson, Tape bounds for time-bounded Turing machines, J. Comput. Systems Science., 6 (1972), 116–124.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Wrocław Uniwersity, Przesmyckiego 20, 51-151, Wrocław, Poland

    Maciej Liśkiewicz & Krzysztof Loryś

Authors
  1. Maciej Liśkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krzysztof Loryś
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liśkiewicz, M., Loryś, K. (1989). Some time-space bounds for one-tape deterministic turing machines. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation