You On AI Field Guide · Leonhard Euler The You On AI Field Guide Home
TxtLowMedHigh
PERSON

Leonhard Euler

The Swiss mathematician who isolated the graph from seven bridges and gave us the number e, the exponential, and the notation we still think with—the man who computed at machine scale, in total darkness, and understood every step.
Leonhard Euler is the mathematician on whose work artificial intelligence literally runs. When engineers describe a neural network as a graph of weighted connections, they are naming the object Euler isolated in 1736 by reducing the Seven Bridges of Königsberg to four dots and seven lines and proving, for the first time, that a truth can live entirely in a structure's connections rather than its substance. His collected Opera Omnia exceeds eighty volumes; he founded graph theory, gave the calculus of variations its machinery, characterized the number e and the exponential whose curve is the exact shape of AI scaling laws, and standardized the notation—f(x), e, Σ, i, π—that made modern mathematics thinkable. He did his most productive work blind, dictating from memory, which makes him the sharpest available lens on the question now haunting the field: can computation proceed without sight, and if it can—as Euler proves it can—what exactly is the thing that distinguishes his blind symbol-manipulation from the machine's? That the question is hard is Euler's most important contribution to the present moment.
Leonhard Euler
Leonhard Euler

In the [YOU] on AI Field Guide

The cycle that began with [YOU] on AI asks what it would mean to see the machine clearly—without hype's narcotic or fear's paralysis. Euler is the figure who supplies the substrate beneath everything the cycle examines: every neural network is a graph, and Euler founded the mathematics of graphs. His Seven Bridges proof is therefore not a historical curiosity but a live schematic of the thing now reshaping human life: an architecture of dots joined by lines, reasoning about what is connected to what, discarding everything else.

Associative Trails and Neural Networks
Associative Trails and Neural Networks

His lens cuts through the field's loudest confusion. We are constantly invited to be impressed by volume—the number of benchmarks a model passes, the words it generates per second, the tasks it performs. Euler is the human refutation: the most prodigious producer in the history of mathematics, whose output exceeded anything a machine yet matches in depth, and who could not be identified as a thinker by his volume alone. The machine can match the exhaust. What Euler's case demands we ask is whether comprehension rides behind it. Volume, he shows, proves nothing.

The book's deepest question concerns computation in the dark. Euler lost his sight in his fifties and produced a substantial fraction of his work completely blind, holding vast calculations in memory and dictating to assistants. He thus proves that genuine, understanding-laden thought can proceed without vision, by the pure manipulation of symbols—which is exactly what large language models do. This eliminates the easy answer. We cannot say the machine merely shuffles symbols without comprehension, because Euler shuffled symbols without sight and no one doubts he understood. What the machine lacks, if it lacks anything, is something harder to locate than perception.

Euler also supplies the exponential, and that gift is concrete. The scaling laws governing today's AI trace the exact curve he characterized when he placed e at the center of analysis: growth that compounds on itself, deceptive early and overwhelming late. To read Euler is to understand, from first principles and in a mathematician's own hand, why the present moment feels simultaneously incremental and vertiginous—and why the people inside an exponential are the last to see its shape.

Origin

Born in Basel in 1707, the son of a Calvinist pastor, Euler was sent to university at thirteen and placed under the informal supervision of Johann Bernoulli, one of the greatest mathematicians of the age. Bernoulli recognized the boy's gifts and made himself available for questions on Sundays; the arrangement proved sufficient. Euler earned his master's degree at sixteen, joined the newly founded Imperial Academy of Sciences in Saint Petersburg at nineteen, and never stopped. He published his first major results in his early twenties and thereafter produced at a rate that astonished contemporaries and still astonishes historians.

The Königsberg paper arrived in 1736 and is the seed of the graph-theoretic world we inhabit. Euler noticed that a puzzle the townspeople had failed to solve by trial was actually a question about structure—about which parcels of land were connected to which and how many bridges made each connection. He stripped the city to a diagram of four points and seven lines and proved, from the degree of each point alone, that the desired walk was impossible. It was the first result in what would become graph theory and, in the same stroke, a founding gesture of topology: the recognition that certain truths live in connectivity, not in geometry.

He spent most of his career at the imperial academies of Saint Petersburg and Berlin, moving between them as patronage and politics shifted. In his early thirties he lost sight in his right eye; decades later a cataract took the left, and a failed surgery left him almost entirely blind. His output did not slow. By some accounts it accelerated, freed from distraction. He died in 1783 in Saint Petersburg, reportedly mid-calculation, and the Academy continued publishing the backlog of his papers for more than forty years after his death.

AI Scaling Laws
AI Scaling Laws

Key Ideas

The graph as substrate of the connected world. Euler's reduction of Königsberg to four nodes and seven edges was the founding act of graph theory: the mathematics of which things are connected to which. Every neural network, every router, every social graph, every knowledge base is an instance of the object he isolated. The odd-degree criterion—a traversal crossing each edge exactly once requires zero or two vertices of odd degree—was the first theorem in a science that now underlies the architecture of the entire connected world.

The exponential and the number e. Euler gave e its symbol, its central role, and its defining property: the unique base for which the exponential function equals its own rate of change. This makes e the mathematics of unconstrained growth—a quantity that increases in proportion to its own size. The scaling laws of contemporary AI trace this curve. The softmax and cross-entropy that govern every model's training are saturated with e. Euler could not have anticipated the application; the mathematics is his, unchanged.

Abstraction that knows what to discard. In every major result, Euler performed the same operation: strip away everything inessential until only the structure remains. He discarded the city and kept the graph; he discarded the shape and kept the Euler characteristic. The critical difference from a machine's abstraction is that his deletions were licensed by proof—he could demonstrate that the discarded detail genuinely did not matter to the question. A model abstracts by gradient descent, deleting whatever did not reduce training error, with no certificate that the deleted feature was not the crux.

Notation as the substrate of thought. Euler standardized f(x), e, Σ, i, and the modern role of π—not as bookkeeping but as cognitive tools. Good notation offloads part of the reasoning into the form of the representation, making certain truths almost visible. The machine's embeddings, which encode meaning as position in high-dimensional space, are Euler's principle taken to its extreme: a representational system of enormous power built by gradient descent that no one designed and no one can fully read.

Computation in the dark. Euler's most productive years were his blind ones, holding entire architectures of calculation in memory. He proves that genuine understanding can proceed without sight, by symbol-manipulation alone—which is formally identical to what a computer does. This eliminates the easy objection to machine intelligence (it merely shuffles symbols in the dark) without settling the hard question: whether the understanding that indisputably accompanied Euler's blind computation also accompanies the machine's.

Debates & Critiques

The deepest debate Euler provokes is whether scale will ever bridge the gap between the curve-fitter and the prover. Optimists note that AI systems trained on text that describes causal and structural reasoning may internalize something like it; they point to emergent capabilities as evidence that the gap is narrowing. Euler's own example cuts the other way: his prodigious, fluent, correct output was the byproduct of comprehension, not its evidence, and a machine can produce comparable output with the comprehension still in question. A second debate concerns what blind computation proves. Euler shows that symbol-manipulation without sight can carry genuine understanding; critics of large language models often reach for the absence of grounded perception as their main objection, but Euler makes that objection unavailable. The real open question is not whether sight is necessary—it isn't—but whether the specific kind of understanding Euler brought to his symbols, the comprehension of why each step was valid and what it implied, is present in the machine's processing or only its output. Alan Turing asked whether machines could think; Euler sharpens the question: machines already compute in the dark as he did, so what, precisely, is the further thing we want to ask?

Euler's Three Gifts to AI

The graph, the exponential, and the question of blind computation
Foundation
The Graph
Euler reduced Königsberg to dots and lines and proved that a truth can live in pure connectivity. Every neural network is built on this object. Graph theory is the mathematics of the connected world.
Shape
The Exponential
Euler characterized e and the curve of unconstrained compounding growth. AI scaling laws trace this exact curve. Its treachery is that it looks flat early and overwhelming late.
Question
Computation Without Sight
Euler computed in total darkness and understood every step. He proves that symbol-manipulation without perception can carry genuine comprehension—and leaves open whether the machine's identical-looking operation also does.

Further Reading

  1. William Dunham, Euler: The Master of Us All (Mathematical Association of America, 1999)
  2. Ronald Calinger, Leonhard Euler: Mathematical Genius in the Enlightenment (Princeton University Press, 2016)
  3. Leonhard Euler, Solutio problematis ad geometriam situs pertinentis (1736) — the Seven Bridges paper, founding graph theory
  4. Leonhard Euler, Introductio in analysin infinitorum (1748) — where e, i, and the exponential-trigonometric connection are established
  5. Leonhard Euler — Wikipedia survey of his life and works
Explore more
Browse the full You On AI Field Guide — over 8,500 entries
← Home0%
PERSONBook →