Turing Completeness

Natural & Formal Sciences Dictionary
A property of a computational system indicating it can simulate any general-purpose programmable machine and thus perform any computation that such an ideal machine can, given unbounded time and memory.