Ada Lovelace
Lovelace didn’t write code — she wrote the first argument for what code could mean.
Abstraction
Leaving the visible world behind, on purpose.
- 24
- in science
- 10:25
- average
- 250 min
- in total
- 407
- across the network
All briefs
Bernhard Riemann
Riemann did not solve physics — he rebuilt its grammar.
Claude Shannon
Shannon didn’t invent the computer — he proved electricity could think.
David Hilbert
Hilbert didn’t build tools—he built the rules for building tools, and then proved some tools can’t be built at all.
Dmitri Mendeleev
Mendeleev didn’t discover elements — he discovered how to think like nature thinks.
Emmy Noether
Noether didn’t just find links between symmetry and conservation—she rebuilt mathematics so those links were inevitable.
Évariste Galois
Galois didn’t just solve an old problem — he invented the language to say why some problems can’t be solved at all.
Felix Klein
Klein didn’t discover space—he discovered how to stop arguing about it.
Fermat's Last Theorem
Andrew Wiles · 1638
Wiles proved Fermat’s Last Theorem by establishing the modularity theorem for semistable elliptic curves — a result that, combined with Ribet’s theorem, ruled out integer solutions to a^n + b^n = c^n for n > 2. His initial 1993 proof contained a flaw in the Selmer group argument; he and Taylor repaired it in 1994 using Galois representations and Iwasawa theory. The complete proof appeared in the Annals of Mathematics in 1995.
Georg Cantor
Cantor didn’t discover infinity — he broke it into pieces you can count, compare, and order.
George Boole
Boole didn’t invent computing — he invented the grammar that lets silicon speak.
Gödel's incompleteness theorems
Kurt Gödel
Gödel’s 1931 incompleteness theorems show that no consistent, effectively axiomatized formal system capable of arithmetic can be both complete and self-consistent. They ended Hilbert’s program. Their method — Gödel numbering and diagonalisation — became foundational for computability theory. They do not apply outside formal systems satisfying strict technical conditions.
Grace Hopper
She didn’t invent the compiler—but she proved code didn’t need to speak machine to get work done.
Hilbert's problems
David Hilbert
Hilbert’s problems are not a discovery in the empirical sense. They are a curatorial act—23 unsolved questions published in 1900 to define mathematics’ trajectory for the next century. Their influence stems from uptake, not truth. They succeeded because mathematicians treated them as a syllabus—not because they were complete, precise or even consistent.
John von Neumann
Von Neumann didn’t build computers—he built the logical floor they stand on, and then proved the floor could hold two floors at once.
Joseph-Louis Lagrange
Lagrange didn’t describe motion — he abolished the need to describe it at all.
Kurt Gödel
Gödel didn’t break mathematics — he mapped its borders with surgical precision.
Noether's theorem
Emmy Noether
Noether's theorem is the rigorous, general proof that continuous symmetries of the action imply conservation laws. It was published in 1918 in Invariante Variationsprobleme. It applies only to smooth, differentiable symmetries in conservative systems. It resolved energy conservation in general relativity. It reshaped theoretical physics’ emphasis toward symmetry.
Richard Feynman
Feynman didn’t explain quantum reality — he built a working language for it.
Srinivasa Ramanujan
Intuition without proof is not mathematics—until the proofs catch up.
Central dogma of molecular biology
Francis Crick
Crick’s central dogma is a precise, unidirectional constraint on sequential information transfer — not a summary of known pathways. It was proposed theoretically, refined formally in 1970, and immediately misrepresented. Its endurance lies not in experimental confirmation but in its utility as a boundary condition: what molecular biology *cannot* do.
Church–Turing thesis
Alonzo Church and Alan Turing
The Church–Turing thesis is not a theorem but a foundational assumption — one that equates human-effective calculation with machine computation. It holds because no counterexample exists, not because it is proven. Its endurance is its strength — and its limitation.
Dartmouth workshop
The Dartmouth workshop didn’t build AI — it invented the idea that AI could be built.
Riemann hypothesis
Bernhard Riemann
Riemann’s 1859 hypothesis is a precise, unproven claim about zeta zeros — central to prime distribution, yet untouched by proof for 165 years.