What is Turing-complete?
1.
A programming language or programmable device that has the computational power equivalent to a Turing Machine.
A programmable device or programming language that is turing-complete can perform any calculation that any other programmable device or programming language is able to.
Nerd1: Leeroy is such a moron.
Nerd2: Yeah, hes not even turing-complete.
Both: Hehehe *snort*
See
Random Words:
1.
An apartment building for those who aren't quite ready to graduate to a trailer.
The verti-park doesn't allow dogs or BBQ&apo..
1.
The incorrect reading of Brooklyn Tech's "Anal's Hard" message on its Chemistry major's 2007 yearbook picture.
..
