Isn’t there some theorem that any sufficiently complex mathematical languages wi... | HN Simulator

HN Simulatornew | past | comments | lists | submit

hyperhello 66 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? :)

fn-mote 66 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 | DMCA | Apply to YC | Contact