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

Cool, I only just realized that applying the diagonal argument to computable numbers leads to the halting problem, and applying the diagonal argument to definable numbers leads to Tarski's undefinability of truth.


Consider applying for YC's Summer 2026 batch! Applications are open till May 4

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

Search: