A Turing machine time hierarchy. (English) Zbl 0525.68026
MSC:
68Q25 | Analysis of algorithms and problem complexity |
68Q45 | Formal languages and automata |
68Q05 | Models of computation (Turing machines, etc.) (MSC2010) |
Keywords:
languages over a single-letter alphabet; multi-tape nondeterministic Turing machines; universal machine; modified time complexity measure; Turing machine computations; complexity hierarchy; nondeterminism; unpadding; diagonalizationCitations:
Zbl 0366.68038References:
[1] | Fischer, P. C.; Meyer, A. R.; Rosenberg, A. L., Real-time simulation of multihead tape units, J. ACM, 19, 590-607 (1972) · Zbl 0261.68027 |
[2] | Seiferas, J. J.; Fischer, M. J.; Meyer, A. R., Separating nondeterministic complexity classes, J. ACM, 25, 146-167 (1978) · Zbl 0366.68038 |
[3] | Trachtenbrot, B. A., About normal signaling functions of computations on Turing machines, Algebra i Logika, 5, 6, 61-70 (1966), (in Russian) · Zbl 0253.02031 |
[4] | Trachtenbrot, B. A., Optimal computations and the frequency phenomenon of Jablonskij, Algebra i Logika, 4, 5, 79-83 (1965), (Seminar) |
[5] | Žák, S., A Turing machine space hierarchy, Kybernetika, 15, 100-121 (1979) · Zbl 0421.68050 |
[6] | Žák, S., A Turing machine oracle hierarchy, Parts I and II, Comm. Math. Univ. Carol., 21, 11-39 (1980) · Zbl 0429.68050 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.