Randomness everywhere
Nature 400:319-320 (1999)
| Abstract | In a famous lecture in 1900, David Hilbert listed 23 difficult problems he felt deserved the attention of mathematicians in the coming century. His conviction of the solvability of every mathematical problem was a powerful incentive to future generations: ``Wir müssen wissen. Wir werden wissen.'' (We must know. We will know.) Some of these problems were solved quickly, others might never be completed, but all have influenced mathematics. Later, Hilbert highlighted the need to clarify the methods of mathematical reasoning, using a formal system of explicit assumptions, or axioms. Hilbert's vision was the culmination of 2,000 years of mathematics going back to Euclidean geometry. He stipulated that such a formal axiomatic system should be both `consistent' (free of contradictions) and `complete' (in that it represents all the truth). Hilbert also argued that any wellposed mathematical problem should be `decidable', in the sense that there exists a mechanical procedure, a computer program, for deciding whether something is true or not. Of course, the only problem with this inspiring project is that it turned out to be impossible. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesPanu Raatikainen (2001). Exploring Randomness. Notices of the AMS 48 (9):992-6.
R. A. V. Yehuda (1999). Why Do We Prove Theorems? Philosophia Mathematica 7 (1).
Y. Rav (1999). Why Do We Prove Theorems? Philosophia Mathematica 7 (1):5-41.
Philip Kitcher (1976). Hilbert's Epistemology. Philosophy of Science 43 (1):99-115.
José Ferreirós (2009). Hilbert, Logicism, and Mathematical Existence. Synthese 170 (1):33 - 70.
Yaroslav Sergeyev (2010). Counting Systems and the First Hilbert Problem. Nonlinear Analysis Series A 72 (3-4):1701-1708.
Carlo Cellucci (1993). From Closed to Open Systems. In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Analytics
Monthly downloads |
Added to index2010-12-22Total downloads3 ( #201,730 of 548,984 )Recent downloads (6 months)1 ( #63,327 of 548,984 )How can I increase my downloads? |
My notes
Discussion
