51
个编辑
更改
→Additional details required to visualize or implement Turing machines
* 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.
( current state q<sub>i</sub> , symbol scanned S<sub>j</sub> , print symbol S<sub>k</sub>/erase E/none N , move_tape_one_square left L/right R/none N , new state q<sub>m</sub> )
( current state q<sub>i</sub> , symbol scanned S<sub>j</sub> , print symbol S<sub>k</sub>/erase E/none N , move_tape_one_square left L/right R/none N , new state q<sub>m</sub> )
(当前状态 q<sub>i</sub> , 已扫描 符号S<sub>j</sub> , 打印符号S<sub>k</sub>/擦除 E/无 N , move_tape_one_square left L/right R/none N , 新状态 q<sub>m</sub> )
(当前状态 q<sub>i</sub> , 已扫描符号S<sub>j</sub> , 打印符号S<sub>k</sub>/擦除 E/无 N , move_tape_one_square left L/right R/none N , 新状态 q<sub>m</sub> )
“计算进度 "图显示了三态穷忙从开始到结束的计算过程中的 "状态"（指令）进度。最右边是每一步的图灵 "完整配置"（Kleene "情况"，Hopcroft-Ullman "瞬时描述"）。如果机器被停止并清空 "状态寄存器 "和整个磁带，则可以使用这些“配置”在其进行中的任何地方重新启动计算（参见Turing（1936）The Undecidable 第139– 140页）。
“计算进度 "图显示了三态穷忙从开始到结束的计算过程中的 "状态"（指令）进度。最右边是每一步的图灵 "完整配置"（Kleene "情况"，Hopcroft-Ullman "瞬时描述"）。如果机器被停止并清空 "状态寄存器 "和整个磁带，则可以使用这些“配置”在其进行中的任何地方重新启动计算（参见Turing（1936）The Undecidable 第139– 140页）。
==Models equivalent to the Turing machine model==
==Models equivalent to the Turing machine model==