baumhaus.digital/Studium Generale/Short History of the Learning Machine/Logic, Gates, Machine/The Thumb Is the State
Look again at the rule table of our Turing machine — the one from the Alan session — and write the state as a bit: CARRY = 1, HALT = 0.
| state c | reads b | writes | next state | move |
|---|---|---|---|---|
| 1 (CARRY) | 0 | 1 | 0 (HALT) | left |
| 1 (CARRY) | 1 | 0 | 1 (CARRY) | left |
| 0 (HALT) | 0 | 0 | 0 | — |
| 0 (HALT) | 1 | 1 | 0 | — |
Writes = b XOR c. Next state = b AND c. The rule table of the machine is the half-adder’s truth table.
A Turing machine is a half-adder with a memory and a moving head. The carry is the thumb of the other hand.