Gregory Chaitin, Kurt Gödel, Paradox, Algorithmic Information, Conservation Laws.
epistemological antinomy can likewise be used for a similar undecidability proof.” Since there is possibly an unlimited number of such antinomies, does that mean there would be potentially an unlimited number of undecidability theorems? GC: Every theorem has an infinite number of possible proofs.