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:

Aifd
1. Accredited membership in AIFD is extremely selective and can be obtained only after a candidate has effectively demonstrated advanced pr..
Read more
Masturbile
1. verb; to exile a room mate from a room/dorm so one can masturbate in solitude. See Sexile. Yesterday I masturbiled my room mate Miguel ..
Read more
Zeetz
1. zeetz is everything and nothing simultaneously. zeetz is another way to say your in love because you are to blind to realize what's..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free