But I think Alon Amit's excellent answer still suffers from viewing proofs as mathematical constructs. If we view them as computational processes then it is trivial to demonstrate that there are true statements which we cannot prove--- because no compact representation of the theorem can exist in our universe, which has less than 2^(10^100) bits to work with.