A programming language is called “Turing complete” if it can run any program that a Turing machine can run, given enough time and memory.