Hilbert's tenth problem

Hilbert's tenth problem was the tenth of twenty-three problems posed by David Hilbert at the International Congress of Mathematicians in 1900. It asked for a general algorithm that could determine, given any Diophantine equation, whether it has integer solutions. The assumption behind the problem was not merely practical — it reflected a deeper conviction that the arithmetic of integers was, in principle, mechanically decidable.

That conviction was false. The negative solution, completed by Yuri Matiyasevich in 1970 building on work by Martin Davis, Hilary Putnam, and Julia Robinson, proved that no such algorithm exists. Matiyasevich's theorem showed that recursively enumerable sets are exactly the Diophantine sets, embedding the halting problem into arithmetic. The problem is therefore not a footnote in the history of logic. It is the point at which mathematics discovered that its simplest infinite structure — the integers — is already beyond the reach of mechanical reason.

Hilbert asked the wrong question, but he asked it at exactly the right moment. The proof that his problem is unsolvable did not close a chapter; it opened one. It showed that the boundary between what can be computed and what cannot is not a feature of abstract machines but a property of the number line itself.