The tight deterministic time hierarchy

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

23 Citations (Scopus)

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

Fingerprint

Turing machines
Tapes

All Science Journal Classification (ASJC) codes

  • Software

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
Fürer, Martin. / The tight deterministic time hierarchy. Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Association for Computing Machinery, 1982. pp. 8-16 (Proceedings of the Annual ACM Symposium on Theory of Computing).
@inproceedings{90ca9c667a3541b1979473a4c8dd74f1,
title = "The tight deterministic time hierarchy",
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.",
author = "Martin F{\"u}rer",
year = "1982",
month = "5",
day = "5",
doi = "10.1145/800070.802172",
language = "English (US)",
isbn = "0897910702",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "8--16",
booktitle = "Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982",

}

Fürer, M 1982, The tight deterministic time hierarchy. in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, pp. 8-16, 14th Annual ACM Symposium on Theory of Computing, STOC 1982, San Francisco, United States, 5/5/82. https://doi.org/10.1145/800070.802172

The tight deterministic time hierarchy. / Fürer, Martin.

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982. Association for Computing Machinery, 1982. p. 8-16 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

TY - GEN

T1 - The tight deterministic time hierarchy

AU - Fürer, Martin

PY - 1982/5/5

Y1 - 1982/5/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0002601160&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0002601160&partnerID=8YFLogxK

U2 - 10.1145/800070.802172

DO - 10.1145/800070.802172

M3 - Conference contribution

AN - SCOPUS:0002601160

SN - 0897910702

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 8

EP - 16

BT - Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982

PB - Association for Computing Machinery

ER -

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