Answer
Gödel's second incompleteness theorem states that any consistent system of axioms whose theorems can be listed by an "effective procedure" (essentially, a computer program) is incomplete. This means that there are statements about the natural numbers that are true, but that are unprovable within the system. Theorem has profound implications for the foundations of mathematics.