Answer
Gödel's Incompleteness Theorem states that no consistent system of axioms whose theorems can be listed by an "effective procedure" (essentially, a computer program) is capable of proving all truths about the natural numbers. This means that there are true statements about the natural numbers that are unprovable within any such system.