Oh no!

Template knot disallowed for unauthenticated users.

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

In pairs. Four numbers: 0101, 0111, 1011, 1111. Increment each using only the two formulas — no counting.

Split the labour like a circuit: one of you computes every XOR, the other every AND and keeps the carry. Fill in a table with columns b, c, out, c′ for each position, right to left.

Check against finger counting. Which number made the carry travel farthest? What is c after the last position of 1111?

0 Axones