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

Is the set of all turing machines finite?


No, but they can be put in a 1-1 mapping with the integers, making them countably infinite.


No, but it only needs to be countable, by my understanding.




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

Search: