Turing Complete refers to a machine that can solve any computational problem, no matter how difficult, given enough time and memory and the proper instructions. Because most modern programming languages are Turing Complete, the term is commonly used to characterize them, e.g. C++.

On a Turing-Complete system, the Halting Problem describes the mathematical impossibility of predicting whether an arbitrary programme will halt or continue indefinitely.