Math & science · 1931
Godel's incompleteness
Godel proves any consistent system rich enough for arithmetic has true but unprovable statements.
It ended Hilbert's hope of a complete foundation for mathematics. His technique of encoding statements as numbers inspired Turing's 1936 theory of computability.