3 ms·
This is not always possible due to the halting problem [1] and Gödel's incompleteness theorems [2]. It is not always possible to formally determine/prove the be
by maxfan8 7y ago
This is not always possible due to the halting problem [1] and Gödel's incompleteness theorems [2]. It is not always possible to formally determine/prove the behavior of a program.
[1]: https://en.wikipedia.org/wiki/Halting_problem https://en.wikipedia.org/wiki/Halting_problem
[2]: https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_...
- lallysingh 7y agoMost software is boring and derivative.
- Groxx 7y agoDoesn't really matter if only unrealistic edge cases are unprovable.
- TuringTest 7y agoThe problem is, you don't know that. The software industry is this complex because obscure yet realistic edge cases happen much more often than you'd expect.
- Groxx 7y agoSo the ones that aren't edge cases can still benefit greatly, rather than not at all.
- TuringTest 7y agoWhat good is applying formal verification software to have proof that part of your input behaves properly, but edge cases are not proven? This is already what test cases do.