The story
On August 8, 1900, at the Second International Congress of Mathematicians in Paris, David Hilbert of Gottingen gave a talk on the future of mathematics. He presented problems that he believed would shape the coming century, ten of them aloud and 23 in the printed version. The list covered logic, number theory, algebra, geometry and analysis. It is the most influential set of open problems in the history of mathematics, and many were solved over the following decades, each result bringing fame to its solver.
Hilbert, then 38, was one of the leading mathematicians in the world. The 19th century had transformed the field. Non-Euclidean geometries, found by Lobachevsky, Bolyai and Gauss, had shown that geometry's axioms could be altered, and Georg Cantor's set theory had opened a world of infinities but also produced paradoxes. Mathematicians wanted to make sure that the foundations were firm. Hilbert's own approach was to trust in axioms, and he said in his talk that he believed every well-posed problem could be solved.
The first problem was Cantor's continuum hypothesis, about the size of the infinity of real numbers; the second was to prove that the axioms of arithmetic are consistent. Others covered the zeros of the Riemann zeta function, one of the great unsolved problems, and whether a general method exists to decide if certain equations have whole-number solutions, answered no by Yuri Matiyasevich in 1970. In 1931 Kurt Godel showed that no consistent system strong enough for arithmetic can prove its own consistency, which ended the second problem in the form Hilbert intended. In 1936 Alan Turing and Alonzo Church, using the Turing machine and lambda calculus, showed that there is no general procedure to decide all mathematical statements, which settled a related question and laid the theoretical base of computer science. The Riemann hypothesis is still open.
Why it mattered
- Godel's incompleteness theorems in 1931 answered Hilbert's second problem in an unexpected way.
- Turing's machine and Church's lambda calculus in 1936 grew from Hilbert's decision problem and became the foundation of computer science.
- Hilbert's program set the agenda for the study of the foundations of mathematics through the 1920s and 1930s.
- The idea of a list of grand challenges inspired later lists, such as the Clay Millennium Prize Problems of 2000.
Sources
- Mathematical Problems (Hilbert, 1900 address) Clark University
- David Hilbert's 24 Problems MacTutor, University of St Andrews
- 1900 ICM - Paris MacTutor, University of St Andrews
- Hilbert problems Encyclopedia of Mathematics
Drafted by AI (Claude) from the sources above and checked against them by AI; no historian has reviewed this page. Spot a mistake? Suggest a correction. How pages are made
Community notes
Loading notes…