The Berry paradox

DOI10.1002/CPLX.6130010107MaRDI QIDQ1361183zbMATH OpenOpenAlexFDO

Authors Gregory J. Chaitin

Publication date 9 June 1998

Published in Complexity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/chao-dyn/9406002

zbMATH Keywords

liar paradoxKolmogorov complexityBerry paradoxGödel's incompleteness theorem

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) General logic (03B99)

Abstract: Lecture given Wednesday 27 October 1993 at a Physics -- Computer Science Colloquium at the University of New Mexico. The lecture was videotaped; this is an edited transcript. It also incorporates remarks made at the Limits to Scientific Knowledge meeting held at the Santa Fe Institute 24--26 May 1994.

Recommendations

• scientific article; zbMATH DE number 515370
• On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
• A Berry-type paradox
• Kolmogorov complexity and the second incompleteness theorem

Cited in

(6)

• On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
• On the foundations of mathematical economics
• A Berry-type paradox
• The false assumption underlying berry's paradox
• scientific article; zbMATH DE number 515370 (Why is no real title available?)

This page was built for publication: The Berry paradox

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361183)