Turing-complete

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 computer, compute


47

Random Words:

1. An inside joke, starting on the JREF forums (randi/vbulletin). Started when a troll declared himself the winner in a thread when his re..
1. Opposite of a doozang. I ordered two doozangs with fried zangdoo on toast...
1. Fem, Derogatory term used to call somebody that lives in the ghetto or a low class neighborhood and have no class, in south America th..