Hacker News Reader

Isn’t there some theorem that any sufficiently complex mathematical languages will have statements that can’t be proven? :)

This would be funny if it were relevant. Seems like a statement about false negatives instead of false positives.

False negative = could not find a proof of a true theorem.

False positive = erroneous proof of a theorem.