Evolutionary computation
Evolutionary computation doesn’t mimic life—it weaponises abstraction to solve engineering problems.
Algorithms
Procedures that decide things, increasingly without being asked.
- 22
- in science
- 11:16
- average
- 248 min
- in total
- 114
- across the network
All briefs
Hypatia
Hypatia didn’t invent new mathematics—she rebuilt the foundations others relied on.
Ada Lovelace
Lovelace didn’t write code — she wrote the first argument for what code could mean.
Al-Khwarizmi
He didn’t invent algebra—he founded it as a discipline with rules, not rhetoric.
Alan Turing
Turing didn’t invent the computer — he proved what computation *is*, and where it must stop.
AlexNet
Depth won the 2012 ImageNet challenge—not cleverness, not data, not theory, but raw, GPU-fuelled layer count.
Cellular automaton
Von Neumann built a grid of simple cells following fixed local rules to answer a question about machines copying themselves, and the idea outgrew its original purpose entirely.
Neural network (machine learning)
Geoffrey Hinton and others
Geoffrey Hinton and colleagues established core methods—backpropagation for representation learning, and Boltzmann machines for unsupervised deep generative modelling—between 1985 and 1995. Their work was grounded in statistical mechanics, experimentally verified on small-scale networks, and explicitly recognised as foundational for machine learning with artificial neural networks. It did not deliver production AI, nor claim to.
É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.
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.
Lambda calculus
Alonzo Church built computation from three constructs and one substitution rule in the 1930s, a system minimal enough that its equivalence to Turing machines still defines what "computable" means, and specific enough to have real blind spots.
Liu Hui
Liu Hui didn’t borrow from Greece — he built a parallel mathematics, complete with proof, algorithms, and limits.
Norbert Wiener
Wiener didn’t invent AI — he invented the idea that purpose could be noise-filtered, feedback-driven, and machine-simulable.
Shakey the robot
Shakey didn’t think like us—but it proved machines could plan like us.
Shor's algorithm
Shor · 1994
Shor’s algorithm is a quantum algorithm for integer factorisation, developed by Peter Shor in 1994. It runs in polynomial time in log N and places factorisation in BQP. It is asymptotically faster than the general number field sieve.
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.
Event Horizon Telescope
In 2019 the Event Horizon Telescope turned eight radio observatories into one Earth-sized instrument and released a picture of the shadow cast by the black hole at the centre of the galaxy M87.
Halting problem
Turing's 1936 proof that no algorithm can tell, for every program and input, whether that program will ever stop running set a permanent boundary on what computation can decide.
Mandelbrot set
Benoit Mandelbrot
Mandelbrot visualised a known mathematical object with unprecedented clarity — making topology legible through computation.
P versus NP problem
Stephen Cook's 1971 paper didn't solve P versus NP — it proved one problem could stand for all of them, which is why the question cryptography rests on is still open.
Turing machine
Alan Turing's 1936 paper described a machine that never got built, made of an infinite tape and a table of rules, to answer a narrow question about mathematical logic — and in doing so proved some problems can never be solved by any computer at all.