News for hackers. Stuff that matters.
Re:Formalizing Fermat's Last Theorem by hyperhello on Friday September 04, 2026 @03:52PM (#49569403)
Isn’t there some theorem that any sufficiently complex mathematical languages will have statements that can’t be proven? :)
Re:Formalizing Fermat's Last Theorem by fn-mote on Friday September 04, 2026 @04:51PM (#49570062)
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.