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.
The six warnings of the dark carnival
1st card: The carnival of carnage
2nd card: The ringmaster
3rd card: The riddlebox
4th card: T..
1.
n. A hypothetical future version of Urban Dictionary in which it is innundated by entries that are not so much definitions of words as ..
