Slashdot is powered by your submissions, so send in your scoop

 



Forgot your password?
typodupeerror

Comment Re:For those who don't know about the Game of Life (Score 4, Informative) 241

Turing-complete means that it is able to perform all of the functions of a universal Turing machine, not that it is able to solve the Turing halting problem; a Turing-complete language (or system) by definition is unable to solve the halting problem expressed within that system.

Slashdot Top Deals

The IBM 2250 is impressive ... if you compare it with a system selling for a tenth its price. -- D. Cohen

Working...