Proving Program Termination, B. Cook et al., CACM v54 n5, May 2011

"In our new problem statement we will still require that a termination proving tool will always return answers that are correct, but we will not necessarily require an answer. If the termination prover cannot prove or disprove termination, it should return 'unknown."'

In contrast to popular belief, proving termination is not always impossible.