Home >
domains >
www.cs.auckland.ac.nz
The Berry Paradox and Godel's Incompleteness Theorem
Transcript of a lecture by Gregory Chaitin on how the Berry Paradox ("the smallest number that needs at least n words to specify it, where n is large") illuminates Godel's Incompleteness Theorem.
|
Keyword |
Results for this URL |
Total searches |