We seem to be missing each other's points, because my point was that you picked a bad example. Prime number generators are either provably correct or provably not. If you use something like Monte Carlo as a heuristic -- to make the algorithm faster -- then it will be provably incorrect. There's no need to wonder if the nth chosen number turns out to be composite; you'll know that, for some large enough n, it will produce a false prime. There's nothing unexpected about it.You seem to be missing the points of these statements.
For example, i dont quote a broken algorithm to have you say that it is a broken algorithm. Why would you think that reply would help when i stated that it is not perfect already? The point was, things look perfect until we find something totally unexpected and then we see the flaw.
What follows could be flaw after flaw, and we hope and pray that as we solve them we get to where we really want to go.
This is not, in general, how anyone does research. Particularly in science, nothing looks perfect -- you start with the assumption that you've made errors. I'm sure I've missed your point again, because I have no idea what you're trying to get at.Things look perfect until we find something unexpected and that could take us down a totally unforeseen path.