0

This is my first time here, as this was originally a pure math question that I figured would be more likely to be answered on this site.
Chaitin's incompleteness theorem states that for any theory whose axioms can be computed by a computer program (e.g. Peano arithmetic, ZFC, etc.), there exists ...