ThesaHelp: references cd
Topic: Kolmorgorov and algorithmic complexity
Topic: randomness
Topic: Godel's incompleteness theorem
 
Reference
Chaitin, G.J.,
"Randomness and mathematical proof",
Scientific American, 232, pp. 4752, May 1975.
Google
Other Reference
page numbers from Chaitin, G.J., Information, randomness & incompleteness, Singapore: World Scientific, p. 313, 1987.
Quotations
7 ;;Quote: only about one in a 1,000 series of digits can be computed by a program that is 10 digits smaller than the series
 7 ;;Quote: to prove that a particular series of digits is random must prove that there is no small program for it; probably impossible

Related Topics
ThesaHelp: references cd (337 items)
Topic: Kolmorgorov and algorithmic complexity (10 items)
Topic: randomness (16 items)
Topic: Godel's incompleteness theorem (19 items)
