FOM: Chaitin and mathematical practice

Richard Heck heck at fas.harvard.edu
Tue Mar 27 13:03:59 EST 2001


>PPS. I believe that Boolos once gave a talk where he claimed that Chaitin's
>incompleteness result was a riff on the Berry paradox (i.e., "the least
>integer that cannot be named in fewer than thirteen words") in the same
>way that Goedel's incompleteness result is a riff on Russell's paradox.
>  Does this sound familiar?  Was it ever published?

See "A New Proof of the Goedel Incompleteness Theorem", in Logic, Logic, 
and Logic, pp. 383-8, at p.386. Boolos attributes the comparison to Chaitin 
himself in "Computational Complexity and Goedel's Incompleteness Theorem", 
AMS Notices17 (1970), p.672.

Richard


----------------------------------------------------------
Richard Heck
Professor of Philosophy
208 Emerson Hall
Harvard University
Cambridge MA 02138
USA

E-mail: heck at fas.harvard.edu
Personal Web Site: http://www.people.fas.harvard.edu/~heck
Department Web Site: http://www.fas.harvard.edu/~phildept






More information about the FOM mailing list