What is Turing Complete?

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. Most modern programming languages are Turing-complete

Note: ANSI SQL is not turing-complete. But TSQL / PLSQL

See more: What is Turing Complete?