Turing Machines with a Schedule to Keep
暂无分享,去创建一个
It is shown that if a sequence of digits α = α 1 α 2 α 3 ··· is generated by a multitape Turing machine so that the n th digit α n is produced no later than time T ( n ), where T is a real-time-countable function, then there exists a multitape Turing machine which generates α and produces α n at exactly time T ( n ). This result makes it possible to strengthen some theorems of Hartmanis and Stearns and to answer a question of Yamada. Other applications yield a more general approach to countability and a new technique for dealing with time-limited computational complexity.
[1] Patrick C. Fischer,et al. Translational methods and computational complexity , 1965, SWCT.
[2] Hisao Yamada,et al. Real-Time Computation and Recursive Functions Not Real-Time Computable , 1962, IRE Trans. Electron. Comput..
[3] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[4] Patrick C. Fischer. On Formalisms for Turing Machines , 1965, JACM.
[5] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.