Randomness everywhere
Nature 400:319-320 (1999)
Authors |
|
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 | (categorize this paper) |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
No references found.
Citations of this work BETA
Critical Computation: Digital Automata and General Artificial Thinking.Luciana Parisi - 2019 - Theory, Culture and Society 36 (2):89-121.
Incompleteness, Complexity, Randomness and Beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
Computing with Cells and Atoms in a Nutshell.Cristian S. Calude & Gheorghe P.?un - 2000 - Complexity 6 (1):38-48.
Similar books and articles
How Metaphysical is “Deepening the Foundations”?: Hahn and Frank on Hilbert’s Axiomatic Method.Michael Stoeltzner - 2001 - Vienna Circle Institute Yearbook 9:245-262.
Counting Systems and the First Hilbert Problem.Yaroslav Sergeyev - 2010 - Nonlinear Analysis Series A 72 (3-4):1701-1708.
From Closed to Open Systems.Carlo Cellucci - 1993 - In J. Czermak (ed.), Philosophy of Mathematics, pp. 206-220. Hölder-Pichler-Tempsky.
Hilbert's Program Then and Now.Richard Zach - 2007 - In Dale Jacquette (ed.), Philosophy of Logic. Amsterdam: North Holland. pp. 411–447.
Husserl's Two Notions of Completeness: Husserl and Hilbert on Completeness and Imaginary Elements in Mathematics.Jairo José Da Silva - 2000 - Synthese 125 (3):417 - 438.
Analytics
Added to PP index
2010-12-22
Total views
6 ( #1,138,022 of 2,520,899 )
Recent downloads (6 months)
1 ( #405,457 of 2,520,899 )
2010-12-22
Total views
6 ( #1,138,022 of 2,520,899 )
Recent downloads (6 months)
1 ( #405,457 of 2,520,899 )
How can I increase my downloads?
Downloads