In a book review of Torkel Franzén's "Gödel’s Theorem: An Incomplete Guide to Its Use and Abuse" in the Notices the reviewer (Raatikainen) writes:
Franzén also devotes a brief chapter to the variants of incompleteness results arising from the so-called Algorithmic Information Theory, or the theory of Kolmogorov complexity, and especially the various philosophical interpretations of these results by Gregory Chaitin (one of the founders of this theory). For example, Chaitin claims that his results not only explain Gödel’s incompleteness theorem but also are the ultimate, or the strongest possible, incompleteness results. Franzén first explains these results and then shows that such claims are in noway justified by mathematical facts.
What "philosophical interpretations" are being referred to?
In what sense could Chatin's theorem be the "ultimate, or the strongest possible, incompleteness result"?
[I know I can read the particular section in Franzén's book, and so I have, but a question here is still relevant and useful to others, and explanations by different people yield often additional insight (so also for me).]