### Abstract

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

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982 |

Publisher | Association for Computing Machinery |

Pages | 8-16 |

Number of pages | 9 |

ISBN (Print) | 0897910702 |

DOIs | |

State | Published - May 5 1982 |

Event | 14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States Duration: May 5 1982 → May 7 1982 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Other

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

Country | United States |

City | San Francisco |

Period | 5/5/82 → 5/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