[share]

1973 โ€“ Lotfi Zadeh founded the field of fuzzy logic.
1974 โ€“ Pierre Deligne solves the last and deepest of the Weil conjectures,
completing the program of Grothendieck.
1975 โ€“ Benoรฎt Mandelbrot publishes Les objets fractals, forme, hasard et dimension.
1976 โ€“ Kenneth Appel and Wolfgang Haken use a computer to prove the Four color theorem.
1981 โ€“ Richard Feynman gives an influential talk "Simulating Physics with Computers"
(in 1980 Yuri Manin proposed the same idea about quantum computations in
"Computable and Uncomputable" (in Russian)).
1983 โ€“ Gerd Faltings proves the Mordell conjecture and thereby shows that
there are only finitely many whole number solutions for each exponent of Fermat's Last Theorem.
1985 โ€“ Louis de Branges de Bourcia proves the Bieberbach conjecture.
1986 โ€“ Ken Ribet proves Ribet's theorem.
1987 โ€“ Yasumasa Kanada, David Bailey, Jonathan Borwein, and Peter Borwein
use iterative modular equation approximations to elliptic integrals and a NEC SX-2 supercomputer
to compute ฯ€ to 134 million decimal places.

1991 โ€“ Alain Connes and John W. Lott develop non-commutative geometry.
1992 โ€“ David Deutsch and Richard Jozsa develop the Deutschโ€“Jozsa algorithm,
one of the first examples of a quantum algorithm that is exponentially faster than
any possible deterministic classical algorithm.
1994 โ€“ Andrew Wiles proves part of the Taniyamaโ€“Shimura conjecture and
thereby proves Fermat's Last Theorem.
1994 โ€“ Peter Shor formulates Shor's algorithm, a quantum algorithm for integer factorization.
1995 โ€“ Simon Plouffe discovers Baileyโ€“Borweinโ€“Plouffe formula capable of finding
the nth binary digit of ฯ€.
1998 โ€“ Thomas Callister Hales (almost certainly) proves the Kepler conjecture.
1999 โ€“ the full Taniyamaโ€“Shimura conjecture is proven.
2000 โ€“ the Clay Mathematics Institute proposes the seven Millennium Prize Problems
of unsolved important classic mathematical questions.