A precise version of a time hierarchy theorem

Fundamenta Informaticae

Volumn 38, Issue 1-2, 1999, Pages 1-15

  Ben Amram, Amir M ^a   Jones, Neil D ^b  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Hierarchy theorem; Time complexity; Universal program

Indexed keywords

EID: 0002602809     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-381201     Document Type: Article

References (9)

1. Ben-Amram, A. M. and Jones, N. D.: "Computational complexity via programming languages: constant factors do matter". Submitted for publication, 1998.
2. Gregusova, L. and Korec, I.: "Small universal Minsky machines". Mathematical foundations of computer science, Proc. 8th Symp., Olomouc/Czech, 1979, Lect. Notes Comput. Sci. 74, 308-316.
3. Jones, N. D.: "Constant time factors do matter". Proc. 25th Annual ACM Symp. on Theory of Computing, 1993, 602-611.
4. Korec, I.: "Small universal register machines", Theor. Comput. Sci., 168(2), 1996, 267-301.
5. Minsky, M. L.: "Size and structure of universal Turing machines using tag systems". Proc. Symp. Pure Math. 5, 1962, 229-238.
6. Rogozhin, Y.: "Small universal Turing machines", Theor. Comput. Sci., 168(2), 1996, 215-240.
7. Sudborough, H. and Zalcberg, Z.: "On families of languages defined by time-bounded random access machines", SIAM Journal of Computing, 5, 1976, 217-230.
8. Watanabe, S.: "5-symbol 8-state and 5-symbol 6-state universal Turing machines", J. Assoc. Comput. Mach., 8, 1961, 476-483.
9. Žák, S.: "A turing machine time hierarchy (note)", Theoretical Computer Science, 26, 1983, 327-333.