2 ms·
It wouldn’t break Rice’s Thm to prove it for a particular program. All Rice’s Thm says is that any algorithm must fail on some programs.
by UncleMeat 4y ago
It wouldn’t break Rice’s Thm to prove it for a particular program. All Rice’s Thm says is that any algorithm must fail on some programs.
- staticassertion 4y agoIt would if you're talking about arbitrary classes of bugs.
- UncleMeat 4y agoNot so. Consider the algorithm that reports "Yes" for all inputs for all program properties. For a large number of programs and properties, this algorithm will report the correct information.