Turing Complete

A language is described as turing complete when it is able to implement any of the Turning Machines.

Effectively it’s measure of how “powerful” a programming language is.

For further useful reading, try the TMML Homepage.