Oh no!

Template knot disallowed for unauthenticated users.

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

In pairs. First: the forgetful machine. It has no thumb: at every cell it behaves as if c = 1 (it always flips the bit and always moves on).

Run it on 0101. What should the answer be? Which inputs does the forgetful machine happen to get right, among the sixteen four-bit numbers?

Then the challenge: run it backwards. Design a rule table for subtract 1 (state BORROW) — hint: it is the increment table with the roles of 0 and 1 exchanged. Test it by counting down from 8 on your hands.

Check yourselves: BORROW reads 0 → write 1, move left, stay in BORROW; BORROW reads 1 → write 0, HALT. In algebra: out = b XOR w, w′ = (NOT b) AND w. (And the forgetful machine is right on 0111 and 1111 only.)

0 Axones