before halting.

For example, in pseudocode, the program

:while (true) continue

never halts; rather, it goes on forever in an infinite loop. By contrast,

halts immediately after printing.

Simple cases like these are easy to decide, but more complex programs are not. Turing proved no algorithm exists that always correctly