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:

Tau Phi Beta
1. Tau Phi Beta was founded at Southern Connecticut University in 1985. They then began a chapter at William Paterson University in 1987. M..
Read more
Mchenry
1. A small, po dunk little town about 45 minutes south of the Wisconsin border. It has recently become more ubanized, but up until about 20..
Read more
Minstrelry
1. To attack with minstrels unto the point of orgasm - romantic revelry to music (never revels however). When those of noble countenaunce a..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free