Theoretically bug-free programs

Posted by user2443423 on Programmers See other posts from Programmers or by user2443423
Published on 2014-05-15T19:57:57Z Indexed on 2014/06/02 21:45 UTC
Read the original article Hit count: 371

Filed under:
|

I have read lot of articles which state that code can't be bug-free, and they are talking about these theorems:

Actually Rice's theorem looks like an implication of the halting problem and the halting problem is in close relationship with Gödel's incompleteness theorem.

Does this imply that every program will have at least one unintended behavior? Or does it mean that it's not possible to write code to verify it? What about recursive checking? Let's assume that I have two programs. Both of them have bugs, but they don't share the same bug. What will happen if I run them concurrently?

And of course most of discussions talked about Turing machines. What about linear-bounded automation (real computers)?

© Programmers or respective owner

Related posts about bug

Related posts about theory