Researched
Hilbert's Problems & Program
In 1900 Hilbert lists 23 open problems and later asks for a complete, provably consistent foundation of mathematics.
Open in the interactive tree →His Paris address set the agenda for much of 20th-century mathematics; some problems are solved, others such as the Riemann hypothesis are still open. His programme to prove all of mathematics consistent by finite means was ended by Gödel's incompleteness theorems in 1931.
Prerequisites
Unlocks
- Gödel's Incompleteness1931Gödel's theorems answered Hilbert's programme to prove mathematics consistent
- Computability (Turing)1936Turing solved Hilbert's decision problem
- Fluid Equations from Atoms2024-2025
Sources
More in Mathematics · Machine Age
- Measure-Theoretic Probability1902-1933
- Markov Chains1906
- Abstract Algebra (Noether)1921-1931
- Gödel's Incompleteness1931
- Computability (Turing)1936