51
个编辑
更改
无编辑摘要
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed.
A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed.
图灵机是一个’’’<font color=’’#ff800’’>数学计算模型mathematical model of computation</font>’’’，它定义了一个抽象的机器，根据规则表在磁带上上操纵符号。尽管这个模型简单，但给定任何’’’<font color=’’#ff800’’>计算机算法computer algorithm </font>’’’，都可以构造一个能够模拟算法逻辑的图灵机。
图灵机是一个’’’<font color=’’#ff800’’>数学计算模型mathematical model of computation</font>’’’，它定义了一个抽象的机器，根据规则表在磁带上上操纵符号。尽管这个模型简单，但对于给定任何’’’<font color=’’#ff800’’>计算机算法computer algorithm </font>’’’，一个能够模拟该算法逻辑的图灵机可以被构造出来。
The machine operates on an infinite memory tape divided into discrete "cells". The machine positions its "head" over a cell and "reads" or "scans" the symbol there. Then, as per the symbol and the machine's own present state in a "finite table" of user-specified instructions, the machine (i) writes a symbol (e.g., a digit or a letter from a finite alphabet) in the cell (some models allow symbol erasure or no writing), then (ii) either moves the tape one cell left or right (some models allow no motion, some models move the head), then (iii) (as determined by the observed symbol and the machine's own state in the table) either proceeds to a subsequent instruction or halts the computation.
The machine operates on an infinite memory tape divided into discrete "cells". The machine positions its "head" over a cell and "reads" or "scans" the symbol there. Then, as per the symbol and the machine's own present state in a "finite table" of user-specified instructions, the machine (i) writes a symbol (e.g., a digit or a letter from a finite alphabet) in the cell (some models allow symbol erasure or no writing), then (ii) either moves the tape one cell left or right (some models allow no motion, some models move the head), then (iii) (as determined by the observed symbol and the machine's own state in the table) either proceeds to a subsequent instruction or halts the computation.
机器在一个无限大的存储磁带上运行，磁带被分割成若干个离散的“单元”。机器将它的“头”定位在一个单元上，并“读取”或“扫描”那里的符号。然后，根据符号和机器本身在用户指定指令的“有限表”中的现状，机器（i）将符号（例如，有限字母表中的一位数字或一个字母）写入单元（某些型号允许擦除符号或不写入字符），然后(ii)将磁带向左或向右移动一个单元格(有些模型允许不移动，有些模型允许移动磁头) ，然后(iii)(根据观察到的符号和机器自身在表中的状态)继续执行后续指令或停止计算。