4 ms·
> * Technically not any, due to Gödel's incompleteness theorem Sorry, but it's not true, see Gödel's completeness theorem. It basically states that any "true"
by leni536 10y ago
> * Technically not any, due to Gödel's incompleteness theorem
Sorry, but it's not true, see Gödel's completeness theorem. It basically states that any "true" statement is provable. So you can verify any correct code as correct. There are problems if you try to verify a not correct code as correct though.
- rntz 10y agoGodel's completeness theorem applies to first-order predicate logic, which is not powerful enough on its own even to express, let alone prove, 1+1=2. First order logic is best thought of as a framework on which other, useful logics may be built. And as soon as you add enough power to first-order-logic to capture Peano arithmetic, you run into incompleteness. C++ behavior is almost certainly more complex than Peano arithmetic.
- catnaroek 10y ago> It basically states that any "true" statement is provable. It states that every statement that is true in all models of a first-order theory is provable within the theory.