The tight deterministic time hierarchy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

Let k be a. constant ≥ 2, and let us consider only deterministic k-tape Turing machines. We assume t2(n) > n and t2 is computable in time t2. Then there is a language which is accepted in time t2, but not accepted in any time t1 with t1(n) = o(t2(n)). Furthermore, we obtain a strong hierarchy (isomorphic to the rationals Q) for languages accepted in fixed space and variable time.

Original languageEnglish (US)
Title of host publicationProceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982
PublisherAssociation for Computing Machinery
Pages8-16
Number of pages9
ISBN (Print)0897910702
DOIs
StatePublished - May 5 1982
Event14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States
Duration: May 5 1982May 7 1982

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Other

Other14th Annual ACM Symposium on Theory of Computing, STOC 1982
CountryUnited States
CitySan Francisco
Period5/5/825/7/82

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'The tight deterministic time hierarchy'. Together they form a unique fingerprint.

  • Cite this

    Fürer, M. (1982). The tight deterministic time hierarchy. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982 (pp. 8-16). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/800070.802172