Each natural number (as defined in standard set theory) is computable; that is, the set of natural numbers less than a given natural number is computable.
The set of Gödel numbers of arithmetic proofs described in Kurt Gödel's paper "On formally undecidable propositions of Principia Mathematica and related systems I"; see Gödel's incompleteness theorems.