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.
noun: a city in orange county, california. nothing exciting goes on in garden grove, and life in it is dull. for some reason, asians fin..
