Become a fan of Slashdot on Facebook

 



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

How long does it take a DEC field service engineer to change a lightbulb? It depends on how many bad ones he brought with him.

Working...