How is this page different from the experience itself?

This localized page is for search and orientation. The interactive 3D experience opens at the language-neutral URL.

Which languages are officially reviewed?

Japanese and English are treated as the officially reviewed text for each exploration.

How are other languages handled?

Other languages are shown as machine translations from the English source with a link back to the original.

Turing Machine

Turing Machine: Concept Machine

Experience computation through the minimal parts of a tape, read/write head, state, and transition rules.

Concept Machine · 1/7

Unravel computation into five minimal operations

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

Start With A MachineReady

Concept MachineJust pick a Preset and Input — do not start operating yet

PresetInput Tape

二進数の右端へ移動し、繰り上がりを処理して1を足します。

Five Phase Map#0 · Read

ReadRead just one cell

RuleChoose one row

WriteUpdate the current cell

MoveSend to the next cell

StateSwitch the context

What you look at first is not “the whole” but the entrance of one instructionLook at the Tape, Head, State, and Rule Table at once. Do not Step yet — just line up the input and the machine’s initial context.Right now Head 0 is at a position where it can read 1.

Getting ready to readBefore any operation, line up the four displays that point at the same momentCompare the Head, State, highlighted Rule Table row, and Tape window. Not Stepping here is so that the first discovery is “reading the correspondence,” not “pressing.”Answer the discovery check and Read narrows the view to just the one cell under the Head.

Rule Tableseek-one

StateReadWriteMoveNext

qSeekEnd00RqSeekEnd

qSeekEnd11RqSeekEnd

qSeekEnd__LqCarry

qCarry10LqCarry

qCarry01SqAccept

qCarry_1SqAccept

Discovery check

What is the order of the one instruction this experience breaks apart and follows?