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

His point is probably along the lines of "any machine emulating a Turing machine can compute all computable functions." Which of course doesn't mean that there aren't uncomputable functions.


He’s indulging the common confusion of theory with practice. Just because something is computable in theory doesn’t mean it’s computable in practice.




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

Search: