探索程式如何寫入紙帶，進而開啟通往通用機與停機問題的道路。
由英文原文機器翻譯而成。 開啟英文原文
In a Universal Machine, the rule table of some Turing machine itself is placed on the tape as a string of symbols. Not only the input but also “which machine to run” becomes data, and the interpreter mimics one step of the target machine while reading that description.
The idea of a universal machine connects to treating a Turing machine’s description as data another machine can read: Stanford Encyclopedia of Philosophy: Turing .
First look at the two tapes. The top is the program tape, the bottom is the input tape. Do not Step here; confirm that the machine and the input are separated.
The heart of Chapter 4 is not a “machine that computes fast” but a “machine that reads the description of a machine as data.”
What newly becomes data in a Universal Machine?
