Just read this part: > So we have a measure of the complexity of a formal mathematical theory A, and in theory A you cannot prove that any program is elegant t

Just read this part: > So we have a measure of the complexity of a formal mathematical theory A, and in theory A you cannot prove that any program is elegant that is larger in size than A’s complexity. That is what the paradoxical program P proves. And thought: hmm. Sounds like, what was it called again? Checks Wikipedia, article on Kolmogorov Complexity. Oh yeah, Chaitin's Incompleteness Theorem. I wonder if it's mentioned in the article. CTRL-F - "Chaitin" ...the writer of this article is Gregory Chaitin.