Gödel's incompleteness theorems

Home > Computer Science > Theory of Computation > Turing Machines > Gödel's incompleteness theorems

A set of two theorems published by Kurt Gödel, which proved that any sufficiently powerful formal system will contain statements that cannot be proven or disproven within that system.