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:

Mulloch
1. Nickname from the surname McCulloch. Mis-pronounced by fellow person evolved to 'Mull' for short (you lazy gits) MULLOCK get ..
Read more
Bruins
1. Pro hockey team from Boston. 2. 1. The team that killed the interest of bostonians in hockey with constant futility and an owner who m..
Read more
Vronsnooker
1. A term used in the movie "Young Frankenstein" to describe Frankenstein's penis. Then he'll have a big vronsnooker!..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free