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:

Shortcurves
1. pure sex. brought to you by the youth of jackson nj. i am part of the shortcurves crew, you are not, for that you must kiss my converse..
Read more
Deficide
1. Voluntary consumption of many laxatives causing profuse expulshion of feces leading to severe internal bleeding and the loss of many vit..
Read more
W
1. Short for George W. Bush, the Prez "W is as dumb as a tree stump" See birdie 2. George W. Bush Coke snorter, pot smoker, ..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free