Revision as of 22:51, 21 November 2008 by Lee462 (Talk)

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)

Alumni Liaison

Ph.D. on Applied Mathematics in Aug 2007. Involved on applications of image super-resolution to electron microscopy

Francisco Blanco-Silva