A computer is Turing complete if it can solve any problem that a Turing machine can, given an appropriate algorithm and the necessary time and memory. When applied to a programming language, this phrase means that it can fully exploit the capabilities of a Turing complete computer.