프로그램을 테이프에 적어 넣는 방법을 탐구하며, 만능 기계와 정지 문제로 이어지는 길을 열어 봐요.
영어 원문에서 기계 번역되었어요. 영어 원문 열기
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?
