更改

==可视化或实现图灵机所需的其他细节==

==可视化或实现图灵机所需的其他细节==

In the words of van Emde Boas (1990), p. 6: "The set-theoretical object [his formal seven-tuple description similar to the above] provides only partial information on how the machine will behave and what its computations will look like."

In the words of van Emde Boas (1990), p. 6: "The set-theoretical object [his formal seven-tuple description similar to the above] provides only partial information on how the machine will behave and what its computations will look like."

===其他定义===

===其他定义===

Definitions in literature sometimes differ slightly, to make arguments or proofs easier or clearer, but this is always done in such a way that the resulting machine has the same computational power. For example, the set could be changed from <math>\{L,R\}</math> to <math>\{L,R,N\}</math>, where ''N'' ("None" or "No-operation") would allow the machine to stay on the same tape cell instead of moving left or right. This would not increase the machine's computational power.

Definitions in literature sometimes differ slightly, to make arguments or proofs easier or clearer, but this is always done in such a way that the resulting machine has the same computational power. For example, the set could be changed from <math>\{L,R\}</math> to <math>\{L,R,N\}</math>, where ''N'' ("None" or "No-operation") would allow the machine to stay on the same tape cell instead of moving left or right. This would not increase the machine's computational power.

其他作者(Minsky，Hopcroft和Ullman，Stone采用了另一种约定，在扫描符号S_j 之后立即列出新状态q_m:

其他作者(Minsky，Hopcroft和Ullman，Stone采用了另一种规定，在扫描符号S_j之后立即列出新状态q_m:

(定义2): (q_i, S_j, q_m, S_k/E/N, L/R/N)

(定义2): (q_i, S_j, q_m, S_k/E/N, L/R/N)

:: '''(''' current state '''q_i''' ''',''' symbol scanned '''S_j''' ''',''' new state '''q_m''' ''',''' print symbol '''S_k'''/erase '''E'''/none '''N''' ''',''' move_tape_one_square left '''L'''/right '''R'''/none '''N''' ''')'''

:: '''(''' current state '''q_i''' ''',''' symbol scanned '''S_j''' ''',''' new state '''q_m''' ''',''' print symbol '''S_k'''/erase '''E'''/none '''N''' ''',''' move_tape_one_square left '''L'''/right '''R'''/none '''N''' ''')'''

  ( 当前状态 q_i , 扫描符号 S_j , 新状态 q_m , 打印 S_k/擦除 E/none N ,  L/right R/none N )

  （当前状态 q_i , 扫描符号 S_j , 新状态 q_m , 打印 S_k/擦除 E/none N ,  L/right R/none N）

其中q_i,是当前状态，S_j是已扫描符号，S_k是打印符号，E是擦除，N是无状态，L是向左移动，R是向右，q_m 是新状态。

其中q_i,是当前状态，S_j是已扫描符号，S_k是打印符号，E是擦除，N是无状态，L是向左移动，R是向右，q_m 是新状态。

For the remainder of this article "definition 1" (the Turing/Davis convention) will be used.

For the remainder of this article "definition 1" (the Turing/Davis convention) will be used.

本文的其余部分将使用“定义1”(图灵/戴维斯规则)。

本文的其余部分将使用“定义1”(图灵/戴维斯规则)。

例子: 将3状态2符号“繁忙的海狸”简化为5元组

例子: 将3状态2符号“繁忙的海狸”简化为5元组

{| class="wikitable" style="text-align: center"

{| class="wikitable" style="text-align: center"

图灵机上下文中使用的“状态”一词可能会引起混淆，因为它可能意味着两件事。图灵之后的大多数研究者都使用“状态”来表示要执行的当前指令的名称/指示符——即状态寄存器的内容。但是图灵 (1936) 在他所谓的机器“m-配置”的记录和机器（或人）通过计算的“进展状态”——整个系统的当前状态——之间做出了强有力的区分。图灵所说的“状态公式”包括当前指令和纸带上的所有符号：

图灵机上下文中使用的“状态”一词可能会引起混淆，因为它可能意味着两件事。图灵之后的大多数研究者都使用“状态”来表示要执行的当前指令的名称/指示符——即状态寄存器的内容。但是图灵 (1936) 在他所谓的机器“m-配置”的记录和机器（或人）通过计算的“进展状态”——整个系统的当前状态——之间做出了强有力的区分。图灵所说的“状态公式”包括当前指令和纸带上的所有符号：

{{quote|Thus the state of progress of the computation at any stage is completely determined by the note of instructions and the symbols on the tape. That is, the '''state of the system''' may be described by a single expression (sequence of symbols) consisting of the symbols on the tape followed by Δ (which we suppose not to appear elsewhere) and then by the note of instructions. This expression is called the 'state formula'.|''The Undecidable'', pp. 139–140, ’’’<font color=’’#32CD32’’> emphasis added </font>’’’}}

{{quote|Thus the state of progress of the computation at any stage is completely determined by the note of instructions and the symbols on the tape. That is, the '''state of the system''' may be described by a single expression (sequence of symbols) consisting of the symbols on the tape followed by Δ (which we suppose not to appear elsewhere) and then by the note of instructions. This expression is called the 'state formula'.|''The Undecidable'', pp. 139–140, ’’’<font color=’’#32CD32’’> emphasis added </font>’’’}}

{{quote|因此，任何阶段的计算进度状态完全由指令注释和纸带上的符号决定。也就是说，系统的状态可以由单个表达式（符号序列）来描述，该表达式由纸带上的符号后跟 Δ（我们假设不会出现在其他地方）和指令注释组成。这个表达式被称为“状态公式”。

{{quote|因此，任何阶段的计算进度状态完全由指令注释和纸带上的符号决定。也就是说，系统的状态可以由单个表达式（符号序列）来描述，该表达式由纸带上的符号后跟 Δ（我们假设不会出现在其他地方）和指令注释组成。这个表达式被称为“状态公式”。