Skip to main content
SpringerLink
Log in

New time hierarchy results for deterministic TMS

  • Conference paper
  • First Online:
Book cover STACS 92 (STACS 1992)

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

Included in the following conference series:

Abstract

We show a method of maintaining a distributed counter by 2-dimensional deterministic Turing machines with at least two tapes. Our method yields a tight time hierarchy for these machines solving an open problem posed by M. Fürer ([Fü1],[Fü2]). Moreover, we improve the best known time hierarchy theorem for one-tape off-line deterministic TMs; among others we show that this hierarchy is tight for functions bounded by polynomials.

This work was supported by the Alexander-von-Humboldt-Stiftung while the author was visited the Lehrstuhl für Theoretische Informatik, Institut für Informatik, Universität Würzburg, 8700 Würzburg, Germany

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. M. Fürer. The tight deterministic time hierarchy. 14th STOC (1982), 8–16.

    Google Scholar 

  2. M. Fürer. Data structures for distributed counting. JCSS 28 (1984), 231–243.

    Google Scholar 

  3. J. Hartmanis. Computational complexity of one-tape Turing machine computations. JACM 15 (1968), 325–339.

    Google Scholar 

  4. F.C. Hennie. One-tape off-line Turing machine computations. Inform. and Contr. 8 (1965), 553–578.

    Google Scholar 

  5. F.C. Hennie and R.E. Stearns. Two-tape simulation of multitape Turing machines JACM 13 (1966), 533–546.

    Google Scholar 

  6. W. Maass, G. Schnitger and E. Szemeredi. Two tapes are better than one for off-line Turing machines. 19th STOC (1987), 94–100.

    Google Scholar 

  7. W.J. Paul. On time hierarchies. 9th STOC (1977), 218–222.

    Google Scholar 

  8. W.J. Paul, E.J. Preuß and R. Reischuk. On alternation. Acta Informatica 14 (1980), 243–255.

    Google Scholar 

  9. S.S. Ruby and P.C. Fischer. Translational methods and computational complexity. 6th Ann. Symp. on Circiut Theory and Log. Design (1965), 173–178.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, ul. Przesmyckiego 20, 51-151, Wroclaw, Poland

    Krzysztof Loryś

Authors
  1. Krzysztof Loryś
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Finkel Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loryś, K. (1992). New time hierarchy results for deterministic TMS. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_194

Download citation

  • DOI: https://doi.org/10.1007/3-540-55210-3_194

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55210-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation