Oh no!

Template knot disallowed for unauthenticated users.

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 creads bwritesnext statemove
1 (CARRY)010 (HALT)left
1 (CARRY)101 (CARRY)left
0 (HALT)000—
0 (HALT)110—

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.

2 Axones

  • ❌ this knot is_linked 🔗 baumhaus.digital/Studium Generale/Prolegomena to Educatio Digitale/Session 8b :: Alan Turing/a Turing machine #1 (ID: 3922 · weight 1)
  • ❌ this knot is_linked 🔗 baumhaus.digital/Studium Generale/Prolegomena to Educatio Digitale/Session 8b :: Alan Turing/a Turing machine #2 (ID: 3923 · weight 1)