A Brief History of the Computability Problem. Gottfried Wilhelm Leibniz (1646 - 1716). Leibniz's computer. Georg Cantor (1845 - 1918). 1886. 1900. David Hilbert (1862 - 1943). 1886. 1900. David Hilbert (1862 - 1943). Hilbert's List (1900). Foundations (general)
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Alonzo Church (1903 - 1995)
Yuri Matiyasevich (1947 - )
e.g., perfect squares are diophantine
Davis Normal Form (1949): each r.e. set admits definition in terms of a
Davis "daring" conjecture (1953):
The recursively enumerable sets are precisely the diophantine sets.
Clay Mathematics Institute: 7 prize problems ($1 million each)
P = NP ?
Poincare conjecture: 3-sphere simply connected?