Gödel's incompleteness theorems
Gödel said that every non-trivial formal system (consistent and axiomatic system with theorems listable by following an algorithm) is incomplete and not provably consistent: