Based on mathworld, The determination of whether a Turing machine will come to a halt given a particular input program.
The halting problem is solvable for machines with less than four states.
moreover, This is also one of the most interesting non-programming parts of computer science study of what can (and cannot) be computed.
-Jungil(lee462 03:38, 18 November 2008 (UTC))
