论文信息 - On non-determinancy in simple computing devices

On non-determinancy in simple computing devices

SummaryThis paper studies one-tape Turing machines with k read-only heads which are restricted to the original input. The main result shows that if any set accepted by such a 3-head non-deterministic Turing machine can be accepted by a deterministic Turing machine with more read-only heads, then the deterministic and non-deterministic context-sensitive languages are identical. Several related results are derived and some tantalizing open problems are discussed.

Juris Hartmanis

[1] Walter John Savitch. Nondeterministic tape bounded turing machines , 1969 .

[2] Juris Hartmanis,et al. Computational complexity of random access stored program machines , 1970, Mathematical systems theory.

[3] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[4] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[5] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[6] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.

[7] M. Rabin. Real time computation , 1963 .

[8] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[9] Juris Hartmanis,et al. An Overview of the Theory of Computational Complexity , 1971, JACM.