Isn’t there some theorem that any sufficiently complex mathematical languages wi... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		hyperhello 8 days ago \| parent \| context \| favorite \| on: Formalizing Fermat's Last Theorem Isn’t there some theorem that any sufficiently complex mathematical languages will have statements that can’t be proven? :)
		help

fn-mote 8 days ago [–]

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.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact