| 单词 | Turing Machine |
| 释义 | Turing MachineA theoretical computing machine which consists of an infinitely long magnetic tape on which instructions can be writtenand erased, a finite register of memory, and a processor capable of carrying out the following instructions: move thetape right, move the tape left, change the state of the register based on its current value and a value on the tape, andwrite or erase a value on the tape. The machine keeps processing instructions until it reaches a particular state, causingit to halt. Determining whether a Turing machine will halt for a given input and set of rules is called theHalting Problem. See also Busy Beaver, Cellular Automaton, Chaitin's Omega, Church-Turing Thesis, ComputableNumber, Halting Problem, Universal Turing Machine
Penrose, R. ``Algorithms and Turing Machines.'' Ch. 2 in The Emperor's New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford, England: Oxford University Press, pp. 30-73, 1989. Turing, A. M. ``On Computable Numbers, with an Application to the Entscheidungsproblem.'' Proc. London Math. Soc. Ser. 2 42, 230-265, 1937. Turing, A. M. ``Correction to: On Computable Numbers, with an Application to the Entscheidungsproblem.'' Proc. London Math. Soc. Ser. 2 43, 544-546, 1938. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。