Hilbert's 23 problems
Era 1 · The foundations (1763–1942) › Logic and the foundations of mathematics
- Lineage
- Symbols and logic
- Kind
- Theory
Who
University of Göttingen
What happened
On August 8, 1900, at the International Congress of Mathematicians in Paris, David Hilbert presents the problems the new century should solve. Ten are read aloud; the published version collects 23.
Why it mattered
It sets the agenda for twentieth-century mathematics. The second problem (proving that arithmetic does not lead to contradiction) and the tenth (a procedure to decide whether an equation has a solution) lead to Gödel and to the idea of an algorithm.
The full story
On August 8, 1900, at the Sorbonne, David Hilbert, a professor at Göttingen, addressed the International Congress of Mathematicians in Paris. Instead of reviewing results, Hilbert put forward the problems the new century ought to solve. Ten were read out in the hall. The version published in Göttingen that same year collects 23, and in 1902 Mary Winston Newson translated it into English for the Bulletin of the American Mathematical Society.
Two of them touch the foundations from which computer science would emerge. The second asks for a proof that the axioms of arithmetic do not lead to contradiction. The tenth asks for a procedure that decides, in a finite number of steps, whether a Diophantine equation has a solution in whole numbers: at bottom it is a request for an algorithm, made before there was any precise definition of what an algorithm is.
The address carries a conviction Hilbert summed up this way: in mathematics there is no ignorabimus; every well-posed problem has an answer. The century proved Hilbert wrong on both of these problems. In 1931 Gödel showed that the consistency of arithmetic cannot be proved with the means of arithmetic itself, which were the means Hilbert asked for, and in 1970 Yuri Matiyasevich, completing the work of Martin Davis, Hilary Putnam, and Julia Robinson, proved that the procedure called for in the tenth problem does not exist.
Leads to
The Entscheidungsproblem (1928)
Inherited, with no proven direct link
The tenth problem asks for a decision procedure for one class of equations; the decision problem asks for one for all of logic, and the impossibility of the first implies that of the second
The incompleteness theorems (1931)
Inherited, with no proven direct link
The second problem asks for a proof that arithmetic is consistent; Gödel's second theorem shows it cannot be proved by arithmetic's own means
Grundbegriffe der Wahrscheinlichkeitsrechnung (1933)
Inherited, with no proven direct link
The sixth problem asks for axioms for probability; Kolmogorov's are the accepted answer
Threads that pass through here
- From Hilbert's question to the universal machine (step 1 of 7)
Sources
Original source
How to cite
“Hilbert's 23 problems.” The History of AI, revised November 13, 2026. https://thehistoryofai.com/en/milestone/hilbert-23-problems
This entry was last reviewed on November 13, 2026.