作者: Michael O. Rabin
DOI: 10.1007/BF02759719
关键词: Turing machine examples 、 Turing machine 、 Theoretical computer science 、 Probabilistic Turing machine 、 Super-recursive algorithm 、 Mathematics 、 Algorithm 、 Time hierarchy theorem 、 NP 、 Universal Turing machine 、 Non-deterministic Turing machine
摘要: We introduce a concept of real-time computation by Turing machine. The relative strengths one-tape versus two-tape machines is established new method proofs impossibility actual computations.