- a programming language is "Turing Complete" if it can run any program that the universal [[Turing Machine]] can run, given unlimited time & memory - you can prove something is Turing Complete by showing that it can simulate a [[Turing Machine]] https://stackoverflow.com/questions/7284/what-is-turing-complete https://math.stackexchange.com/questions/112011/how-to-prove-a-programming-language-is-turing-complete