  Even the r.e.-complete Halting problem has many important feasible subproblems.  Given a program, it is in general not possible to figure out what it does and whether or not it eventually halts.  However, most programs written by programmers or students can be automatically analyzed, optimized and even corrected by modern compilers and model checkers.