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

You learned it, but the author worked it out for himself.

Good for him - kudos.



He had probably previously encountered Cantor's diagonalization technique for proving the uncountability of the reals. He just saw how to apply the same technique to the question of describability.


It's important to note that the "diagonal argument" used to show countability of rationals or describable numbers is completely different from the one used to show the uncountability of the reals. In fact, the two counting arguments used to show countability of rationals and describable numbers are themselves quite different (I would say the latter isn't even a diagonal argument at all; it just goes through a countable union of finite sets one by one).




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: