“Non-diagonizeable” paradoxes. Turing’s Halting Problem also belongs here, but, unlike Berry’s Paradox, it is obviously diagonizeable.

Berry’s Paradox #

• Casual: Beckenbach
• Logic: cf wiki
• Comp: cf. Let me propose a candidate: “Kolmogorov complexity is not computable.” to Tao’s question.

Kolmogorov Complexity #

• Halting to Kolmogorov

Chaitin’s Constant or Omega #

• as Revelation