The halting problem is intractable only with infinite memory (infinite tape for turing machines). Our current computers all have finite memory and so a trivial

The halting problem is intractable only with infinite memory (infinite tape for turing machines). Our current computers all have finite memory and so a trivial algorithm can tell if a real program on a real computer will halt (terminate) or not. Of course the trivial algorithm has huge (but finite) memory requirement :)