LOGIKĒ · XII · Boolean algebra becomes the circuit
Claude Shannon
1916 – 2001 · Michigan & MIT & Bell Labs · "A Symbolic Analysis of Relay and Switching Circuits", 1937 · "A Mathematical Theory of Communication", 1948
Boole made logic an algebra of 0 and 1. Eighty years later a 21-year-old MIT student wrote what's been called the most important master's thesis ever — and it was a single, devastating observation: a switch is a bit. An electrical switch is open (0) or closed (1); wire two in series and current flows only if both are closed — that's AND; wire them in parallel and current flows if either is closed — that's OR. So Boole's algebra of thought is literally the algebra of circuits, which means any logical function can be built from switches — and, crucially, simplified by algebra into fewer parts. That is the logic gate, and every digital computer, born on paper in 1937. A decade later he did it again: he founded information theory and named the bit.
✓ STRONG
The keystone, and exact. Switching algebra (1937) and information theory (1948) are rigorous and foundational — between them they define how every computer computes and how every channel communicates.
◐ BUILT ON BOOLE
He bridged, didn't invent the algebra. The logic is Boole's; Shannon's genius was seeing it is the algebra of switches — the engineering link. Information theory, by contrast, he built largely from scratch.
◔ "BIT" HAS LIMITS
A precise engineering quantity. Shannon entropy measures uncertainty / message length — not meaning, truth, or value. "Information" in his sense is not the everyday word; conflating them is a common error.
I · A switch is a bit — series is AND, parallel is OR
The whole 1937 thesis in one panel. Two switches, A and B; click to open (0) or close (1). Choose how they're wired — series or parallel — and optionally invert. The lamp lights exactly when current can flow, and that condition is a Boolean expression. This is the moment logic stopped being philosophy and became hardware.
switches:
lamp is ON · current flows iff the expression is 1
A · B
Series = both closed = AND. Parallel = either closed = OR. A switch in the broken position = NOT. Three wiring patterns reproduce the entire truth table — and a relay (a switch driven by another circuit) lets one gate's output drive the next, which is all a processor is. This panel is the literal ancestor of every gate in PSĒPHOS.
II · The algebra shrinks the circuit
Shannon's thesis didn't just build circuits — it minimised them. Each relay cost money, space, and reliability, so reducing a Boolean expression meant a cheaper machine. Define any function of A and B by clicking its four outputs; the naive build (one AND-gate per true row, all OR'd) sits on the left, and the algebra's minimal form on the right. Watch the gate count fall — and note honestly when it can't (some functions, like XOR, are already minimal).
NAÏVE — SUM OF PRODUCTS
MINIMISED BY ALGEBRA
Click the OUT cells above to change the function. The reduction (e.g. A·B + A·B̄ = A) is exact Boolean algebra — the same automatic minimisation a logic-synthesis tool runs on a billion-transistor chip today.
III · The bit — measuring information itself (1948)
Eleven years on, Shannon asked a deeper question: how much information is in a message? His answer founded an entire field. A fair coin carries exactly one bit of uncertainty; a two-headed coin carries zero (you already know the outcome). The measure is the entropyH(p) = −p·log₂p − (1−p)·log₂(1−p) — maximal at p = ½, vanishing at certainty. Drag the coin's bias and watch the information it carries.
P(heads) = 0.50
information = 1.000 bits
The bit is the unit of all of this. Boole's 0/1 became Shannon's switch became Shannon's bit — the atom of computing and communication alike. Entropy also sets the hard floor on compression (you cannot losslessly squeeze a message below its entropy) and the ceiling on a channel's capacity. ⚠ Honest: this "information" is uncertainty/message-length — not meaning or importance; a page of noise has high entropy and no sense.
"I just wondered how things were put together." — Claude Shannon
IV · The keystone, the man, and the loop closes
1937 · THE GATE
Boolean algebra is switching algebra — logic becomes a circuit you can build and minimise. The foundation of all digital design; the birth certificate of the logic gate.
1948 · THE BIT
Information has a precise measure — entropy — and a unit, the bit. Compression limits, channel capacity, error correction: the whole digital age rests on it.
Gate kept on. Two clarities. The algebra is Boole's — Shannon's 1937 leap was the bridge (this algebra is the algebra of switches), an act of recognition as profound as an invention, but a bridge nonetheless; the 1948 information theory, by contrast, was his own near-from-scratch creation. And "information" is a technical term: Shannon entropy measures uncertainty and message length, not meaning, truth, or worth — the most common abuse of his work is to read the everyday word into the equation. The man: a playful tinkerer who built a juggling-machine, a maze-solving mechanical mouse, and a rocket-powered frisbee, rode a unicycle down the Bell Labs halls, and treated genius as recreation. He gave the machine age both of its halves and seemed to regard it as the most natural fun in the world.
The loop closes — Thales to the gate
Thales proves the first theorem · Aristotle formalises the syllogism · Euclid the axiomatic method · Chrysippus propositional logic & the truth table · Llull the first logic machine · Leibniz "let us calculate" + binary · Boole logic = algebra of 0/1 · De Morgan the duality & NAND · Frege quantifiers & predicate logic · Gödel the limits of proof · Turing the universal machine · Shannon — the gate.
2,500 years of walking logic into mathematics arrives at the switch. From here the lineage flows out of LOGIKĒ and into PSĒPHOS — the processors — where Boole's algebra, made physical by Shannon, runs a billion times a second on every chip on Earth. The algebra of thought became the engine of the machine. The loop is closed.