Turing-complete definition

(computing theory) Equivalent in power to a universal Turing machine; equivalently, functionally complete.