Analogy between Gödel's incompleteness proof and Richard's argument
Both examples are instances of diagonalization, a technique also used to prove Cantor's theorem ($\kappa &lt; 2^\kappa$ for all cardinals $\kappa$) and Turing's theorem that the halting problem is undecidable.

An analogy is by nature informal. It is not supposed to be rigorous.