TY - GEN

T1 - The tight deterministic time hierarchy

AU - Fürer, Martin

N1 - Publisher Copyright:
© 1982 ACM.

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

T2 - 14th Annual ACM Symposium on Theory of Computing, STOC 1982

Y2 - 5 May 1982 through 7 May 1982

ER -