Hacker News new | past | comments | ask | show | jobs | submit login

There is a correspondence between proofs and programs (curry-howard) so I guess if there are non computable functions, there are non computable proofs?





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

Search: