>>6
Perhaps you should've read more than just the first sentence of the Wikipedia article?
In computability theory, an abstract machine or programming language is called Turing complete, Turing equivalent, or (computationally) universal if it has a computational power equivalent to (i.e., capable of emulating) a simplified model of a programmable computer known as the universal Turing machine. Being equivalent to the universal Turing machine essentially means
being able to perform any computational task – though it does not mean being able to perform such tasks efficiently, quickly, or easily.