> QA: I can write a lot of tests, run fuzzers, but actually proving that A == B is undecidable!
A == B is undecidable for some choice of A and B. It's may very well not be for the particular A and B that you've handed to QA.
In a practical sense, though, it's worth noting that the excuse doesn't really derive from theoretical undecideability.
What we really care about is "can the benefit here be worth the cost". Depending on how you look at it, when it's undecidable there's infinite cost or no benefit, so in that case the answer is clear. But there are probably arbitrarily hard problems shy of undecidable. We occasionally solve math problems that people tens or hundreds of people have been working hard on for decades - those weren't undecidable.
A == B is undecidable for some choice of A and B. It's may very well not be for the particular A and B that you've handed to QA.
In a practical sense, though, it's worth noting that the excuse doesn't really derive from theoretical undecideability.
What we really care about is "can the benefit here be worth the cost". Depending on how you look at it, when it's undecidable there's infinite cost or no benefit, so in that case the answer is clear. But there are probably arbitrarily hard problems shy of undecidable. We occasionally solve math problems that people tens or hundreds of people have been working hard on for decades - those weren't undecidable.