Can someone explain, in a concise way, how that works? Preferably with not to much math.
"Gödel's First Incompleteness Theorem tells us that no computer, working within a fixed formal system F such as Zermelo-Fraenkel set theory, can prove the sentence
G(F) = "This sentence cannot be proved in F."
It's tough to get much more detailed without diving in the whole morass.