TO HALT OR NOT TO HALT? THAT IS THE QUESTION

This is a book about the 'Halting Problem', arguably the most (in)famous computer-related problem: can an algorithm decide in finite time whether an arbitrary computer program eventually stops? This seems a dull, petty question: after all, you run the program and wait till it stops. However, what if the program does not stop in a reasonable time, a week, a year, or a decade? Can you infer that it will never stop? The answer is negative. Does this raise your interest? If not, consider these ...