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". This issue is also one of the most interesting non-programming parts of computer science study of what can be computed or not.
--lee462 03:48, 22 November 2008 (UTC)
