# On interpreting Chaitin's incompleteness theorem

*Journal of Philosophical Logic*27 (6):569-586 (1998)

**Abstract**

The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good measure of the strength of the theory. I exhibit certain strong counterexamples and establish conclusively that the received view is false. Moreover, I show that the limiting constants provided by the theorem do not in any way reflect the power of formalized theories, but that the values of these constants are actually determined by the chosen coding of Turing machines, and are thus quite accidental

**Categories**

(categorize this paper)

**Reprint years**

2004

**PhilPapers/Archive ID**

RAAOIC

**Upload history**

Archival date: 2017-04-11

View other versions

View other versions

**Added to PP index**

2009-01-28

**Total views**

476 ( #9,965 of 54,432 )

**Recent downloads (6 months)**

62 ( #10,307 of 54,432 )

How can I increase my downloads?

**Downloads since first upload**

*This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.*