Turing machine 图灵机
（重定向自Deterministic Turing machine）
![Automata theory.svg](/Images/godic/202501/08/Automata_theory.svg4443.png")
![The](/Images/godic/202501/08/State_diagram_3_state_busy_beaver_2B.svg4443.png")
![The evolution of the busy-beaver's computation starts at the top and proceeds to the bottom.](/Images/godic/202501/08/State_diagram_3_state_busy_beaver_44443.JPG")
![An implementation of a Turing machine](/Images/godic/202501/08/Model_of_a_Turing_machine4443.jpg")
A Turing machine is an abstract machine that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model that defines such a device. Despite the model's simplicity, given any computer algorithm, a Turing machine can be constructed that is capable of simulating that algorithm's logic.