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

Yes, it is impossible. See: Halting problem.


The thing about program verification is that everyone knows that of course it is in general impossible. However, I am not writing a simulator. Most of the code I write does not actually take advantage of the power of a Turing machine.

The fact that the general problem is impossible does not mean that the entire area of study is useless.





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

Search: