The Berry Paradox and Godel's Incompleteness Theorem

cs.auckland.ac.nz

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.

Rate This Site

More in Paradoxes Report

QR Code

Download PNG

Embed Badge

<a href="https://e-sygoing.link/go/7782698" title="The Berry Paradox and Godel&#039;s Incompleteness Theorem"><img src="https://e-sygoing.link/badge.php?lid=7782698" alt="Listed on e-sygoing.link" height="20"></a>

Place this code on your website to show you're listed here.

The Berry Paradox and Godel's Incompleteness Theorem

Rate This Site

Submit Your Site

Related Links