更改

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

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

|+State table for 3 state, 2 symbol busy beaver

|+ State table for 3-state, 2-symbol busy beaver

 

! rowspan="2" | 纸带符号

! colspan="3" | 当前状态 A

! rowspan="2" | l

! colspan="3" | 当前状态 B

 

! colspan="3" | 当前状态 C

 

! colspan="3" | Current state A

 

! colspan="“3”" | 当前状态 A

 

! colspan="3" | Current state B

 

! colspan="“3”" | 当前状态 B

 

! colspan="3" | Current state C

 

! colspan="“3”" | 当前状态 C

 

|- style="font-size:9pt"

|- style="font-size:9pt"

| 写入符号

| 写入符号

 

| 移动纸带

|移动磁带

| 下一个状态

 

|下一个状态

 

 

| 写入符号

| 写入符号

 

| 移动纸带

| Move tape

| 下一个状态

 

 

| Next state

 

下一个状态

 

 

| 写入符号

| 写入符号

 

| 移动纸带

| Move tape

| 下一个状态

 

 

| Next state

 

下一个状态

 

|-

|-

| 0

| 0

| 1

| 1

| R

| R

|'''B'''

| '''B'''

| 1

| 1

| L

| L

|'''A'''

| '''A'''

| 1

| 1

| L

| L

|'''B'''

| '''B'''

|-

|-

| 1

| 1

| 1

| 1

| L

| L

|'''C'''

| '''C'''

| 1

| 1

| R

| R

|'''B'''

| '''B'''

| 1

| 1

| R

| R

|'''HALT'''

| '''停机'''

 

 

|}

|}

==Additional details required to visualize or implement Turing machines==

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

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."

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."

用范·埃姆德·博阿斯 van Emde Boas (1990)的话来说，第6页: “集合理论对象(类似于上面的形式七元组描述)只提供了关于机器将如何运行以及它的计算将是什么样子的部分信息。”

用Van Emde Boas (1990)的话来说: “集合论对象(类似于上面的七元组描述形式)只提供了关于机器将如何运行以及它的计算将是什么样子的部分信息。”

 

For instance,

For instance,

* There will need to be many decisions on what the symbols actually look like, and a failproof way of reading and writing symbols indefinitely.

* There will need to be many decisions on what the symbols actually look like, and a failproof way of reading and writing symbols indefinitely.

* The shift left and shift right operations may shift the tape head across the tape, but when actually building a Turing machine it is more practical to make the tape slide back and forth under the head instead.

* The shift left and shift right operations may shift the tape head across the tape, but when actually building a Turing machine it is more practical to make the tape slide back and forth under the head instead.

* The tape can be finite, and automatically extended with blanks as needed (which is closest to the mathematical definition), but it is more common to think of it as stretching infinitely at one or both ends and being pre-filled with blanks except on the explicitly given finite fragment the tape head is on.  (This is, of course, not implementable in practice.)  The tape ''cannot'' be fixed in length, since that would not correspond to the given definition and would seriously limit the range of computations the machine can perform to those of a [[linear bounded automaton]] if the tape was proportional to the input size, or [[finite state machine]] if it was strictly fixed-length.

* The tape can be finite, and automatically extended with blanks as needed (which is closest to the mathematical definition), but it is more common to think of it as stretching infinitely at one or both ends and being pre-filled with blanks except on the explicitly given finite fragment the tape head is on.  (This is, of course, not implementable in practice.)  The tape ''cannot'' be fixed in length, since that would not correspond to the given definition and would seriously limit the range of computations the machine can perform to those of a [[linear bounded automaton]] if the tape was proportional to the input size, or [[finite state machine]] if it was strictly fixed-length.

磁带可以是有限的，并根据需要自动延伸出空白（这是最接近数学定义的），但更常见的是将其视为在一端或两端无限延伸，除了磁头所在的明确给定的有限片段外，都会被预先填充空白。(当然，这在实践中是无法实现的。)磁带的长度不能是固定的，因为那不符合给定的定义，而且会严重限制机器可以执行的计算范围，如果磁带与输入大小成正比，则为’’’<font color=’’#ff8000’’> 线性有界自动机 linear bounded automaton</font>’’’的计算范围，如果磁带是严格的固定长度，则为’’’<font color=’’#ff8000’’>有限状态机 finite state machine</font>’’’的计算范围。

* 纸带可以是有限的，并根据需要自动延伸出空白（这是最接近数学定义的），但更常见的是将其视为在一端或两端无限延伸，除了读写头所在的明确给定的有限片段外，都会被预先填充空白。(当然，这在实践中是无法实现的。)纸带的长度不能是固定的，因为那不符合给定的定义，而且会严重限制机器可以执行的计算范围，如果纸带与输入大小成正比，则为线性有界自动机的计算范围，如果纸带是严格的固定长度，则为有限状态机的计算范围。

===Alternative definitions===

===其他定义===

其他定义

其他定义

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.

文献中的定义有时会稍有不同，以使论证或证明更容易或更清晰，但这总是以这样的方式进行的，即所得机器具有相同的计算能力。例如，集合可以从 <math>\{L,R\}</math> 改为 <math>\{L,R,N\}</math>其中N("无 "或 "无操作")将允许机器停留在同一磁带单元上，而不需要左右移动。这不会增加机器的计算能力。

文献中的定义有时会稍有不同，以使论证或证明更容易或更清晰，但这总是以使所产生的机器具有相同的计算能力的方式进行。例如，集合可以从 <math>\{L,R\}</math> 改为 <math>\{L,R,N\}</math>其中N("无 "或 "无操作")将允许机器停留在同一纸带单元上，而不需要左右移动。这样不会增加机器的计算能力。

The most common convention represents each "Turing instruction" in a "Turing table" by one of nine 5-tuples, per the convention of Turing/Davis (Turing (1936) in ''The Undecidable'', p.&nbsp;126-127 and Davis (2000) p.&nbsp;152):

The most common convention represents each "Turing instruction" in a "Turing table" by one of nine 5-tuples, per the convention of Turing/Davis (Turing (1936) in ''The Undecidable'', p.&nbsp;126-127 and Davis (2000) p.&nbsp;152):

The most common convention represents each "Turing instruction" in a "Turing table" by one of nine 5-tuples, per the convention of Turing/Davis (Turing (1936) in The Undecidable, p.&nbsp;126-127 and Davis (2000) p.&nbsp;152):

最常见的规则是根据图灵/戴维斯的规则，在“图灵表”钟永9个5元组中的一个表示每个“图灵指令”（图灵1936年在《The Undecidable》p.126-127）：

（定义1） ：（(q_i, S_j, S_k/E/N, L/R/N, q_m)）

按照Turing/Davis（Turing（1936）在The Undecidable，第126-127页和戴维斯（2000）中的约定），最常见的约定由九个5元组之一表示“ 图灵表”中的每个“ 图灵指令” 。第152页）：

Other authors (Minsky (1967) p.&nbsp;119, Hopcroft and Ullman (1979) p.&nbsp;158, Stone (1972) p.&nbsp;9) adopt a different convention, with new state '''q_m''' listed immediately after the scanned symbol S_j:

Other authors (Minsky (1967) p.&nbsp;119, Hopcroft and Ullman (1979) p.&nbsp;158, Stone (1972) p.&nbsp;9) adopt a different convention, with new state q_m listed immediately after the scanned symbol S_j:

Other authors (Minsky (1967) p.&nbsp;119, Hopcroft and Ullman (1979) p.&nbsp;158, Stone (1972) p.&nbsp;9) adopt a different convention, with new state q_m listed immediately after the scanned symbol S_j: