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

Godel's Incompleteness Theorem proves that at least in math, there's a tradeoff between power and completeness / consistency, in that formal systems than can encode arithmetic can prove more things, but they are necessarily either inconsistent or incomplete.

Would make a lot of sense if this tradeoff were also present in other contexts.



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

Search: