Turing complete facts for kids
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.
Turing complete Facts for Kids. Kiddle Encyclopedia.