turing complete is a term used in computability theory to describe abstract machines, usually called automata. such an automaton is turing complete, if it can be used to emulate a turing machine. it is also called computationally universal.