Well: the halting problem is undecidable. That does not prevent us to try and prove (many many times) that an algorithm does or does not stop. I guess the pare

Well: the halting problem is undecidable. That does not prevent us to try and prove (many many times) that an algorithm does or does not stop. I guess the parent meant something like this. Of course the concepts are totally dissimilar but the practical consequences are less apart.