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. When you go down on, or have sex with a recently open scar from surgery on your mate. Matt: "Dude I so hit that last night." ..
1. A homosexual. "I'm not a knob-jockey. I like girls!" 2. A Homosexual. Imagine a man riding a horse. Now replace that h..
1. A paradox in applied philosophy analogous to Heisenberg's Uncertainty Principle. Tenet 1 - Advice or information taken from Zeno a..