Skip to content
Hi, Bot

Hi, Bot · First Principles · Phase 2: Structure, proof, discrete systems

Lesson 15 of 48

Boolean algebra

Truth tables and gates — the arithmetic underneath the hardware.

Two values, a handful of operations, complete rules. One gate — NAND — suffices to build everything above it, which means every chip you have used is an enormous pile of one operation.

Do this

Build XOR out of NAND gates only, and verify it with a complete truth table you filled in by hand — all four rows, every intermediate wire.

The question that unlocks the next lesson

Boolean OR is true when…

  • Aexactly one input is true
  • Bat least one input is true, including both
  • Cboth inputs are true
  • Dneither input is true

Start at lesson 1 and work up to this one

48 lessons, one a day. Answer each lesson's question correctly and the next one opens immediately — nothing here is unlocked by waiting.

By submitting, you agree to our Terms and Privacy Policy.