Line 3: Line 3:
  
  
-Jungil([[User:lee462|lee462]] 03:38, 18 November 2008 (UTC))
+
-Jungil([[User:lee462|lee462]] 03:38, 21 November 2008 (UTC))

Latest revision as of 06:53, 22 November 2008

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, 21 November 2008 (UTC))

Alumni Liaison

Meet a recent graduate heading to Sweden for a Postdoctorate.

Christine Berkesch