Help


from Wikipedia
« »  
For each specific consistent effectively represented axiomatic system for the natural numbers, such as Peano arithmetic, there exists a constant N such that no bit of Ω after the Nth can be proven to be one or zero within that system.
The constant N depends on how the formal system is effectively represented, and thus does not directly reflect the complexity of the axiomatic system.
This incompleteness result is similar to Gödel's incompleteness theorem in that it shows that no consistent formal theory for arithmetic can be complete.

1.843 seconds.