Experience computation through the minimal parts of a tape, read/write head, state, and transition rules.
Được dịch máy từ bản gốc tiếng Anh. Mở bản gốc tiếng Anh
A Turing machine is an abstract machine that defines computation with only a tape, a head, a state, and rules. Here we do not reproduce the insides of a CPU; instead we make it possible to follow by hand how one instruction closes, in what reading order. The first goal is not to produce an answer, but to become able to read the Tape, Head, State, and Rule Table as pointing at the same moment.
The basic makeup of a Turing machine is Stanford Encyclopedia of Philosophy: Turing also lays out as the relationship between tape, head, state, and instruction table.
Once you pick a Preset and Input, compare the central head, the current state, and the highlighted row of the Rule Table. Do not press Step yet — just look for where this one instruction begins.
The order to look is not “the whole” but “the current cell.” Here you grasp the small promise that a long computation advances little by little from only finite states and local symbols.
二進数の右端へ移動し、繰り上がりを処理して1を足します。
What is the order of the one instruction this experience breaks apart and follows?
