Definitions by vaxt
turing-complete
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.
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.
turing-complete by vaxt February 1, 2006
np-complete
A problem so gangsta that you best be busting out your pocket non-deterministic turing machine to solve. No pimp should be caught solving problems in anything slower than polynomial time. That just ain't right.
np-complete by vaxt February 1, 2006
non-deterministic turing machine
A machine capable of solving the toughest mathematical problems in polynomial time. It knows everything, is all powerful and gives you answers before you even ask a question. I didn't know what to write here, so I asked it, it gave me this response.
Guy1: What do they keep in area 51?
Guy2: The non-deterministic turing machine. They don't want you to know they have it, but they've been using it to solve crazy math problems in polynomial time for YEARS!
Guy1: Dude, you're fucked up.
Guy2: The non-deterministic turing machine. They don't want you to know they have it, but they've been using it to solve crazy math problems in polynomial time for YEARS!
Guy1: Dude, you're fucked up.
non-deterministic turing machine by vaxt February 1, 2006