baumhaus.digital/Studium Generale/Short History of the Learning Machine/Logic, Gates, Machine/Exercise · Thumb Logic
In pairs. Each of you hides a thumb behind your back (up = 1, down = 0) and shows it on three. The teacher calls the gate:
| a | b | AND | OR | XOR | NAND |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 1 | 1 | 1 | 0 | 0 |
Show thumbs. As a pair, say the output before checking the table — then check it.
Reverse round: the teacher says gate and output (“XOR gives 1”); you show a pair of thumbs that produces it. Is the answer always unique? For which calls is there only one?