Oh no!

Template knot disallowed for unauthenticated users.

baumhaus.digital/Studium Generale/Short History of the Learning Machine/Logic, Gates, Machine/Exercise · Two Hands, One Machine

Alone, then compare. Right hand = tape (thumb is the lowest bit). Left thumb = the state c.

Raise your left thumb: you are adding 1. Now walk along the right hand, thumb to little finger. At every finger say out loud: “out = b XOR c” (set the finger to that value) and “c = b AND c” (set your left thumb to that).

Once the left thumb is down you may stop — nothing further can change.

Count from 0 to 31 this way. Then 31 + 1: the left thumb is still up after the little finger. That is the carry that fell off the tape — overflow. Turing’s tape is infinite; your hand is not.

1 Axones

  • ❌ this knot is_linked 🔗 baumhaus.digital/Studium Generale/Prolegomena to Educatio Digitale/Session 7 :: Repetitio/Binary adder on Your hands: transition rules (ID: 3896 · weight 1)