Just read this part:<p>&gt; 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.<p>And thought: hmm. Sounds like, what was it called again? <i>Checks Wikipedia, article on Kolmogorov Complexity.</i> Oh yeah, Chaitin&#x27;s Incompleteness Theorem. I wonder if it&#x27;s mentioned in the article. CTRL-F - &quot;Chaitin&quot;<p>...the writer of this article is Gregory Chaitin.