Turing-Complete

Turing-complete refers to the ability of a machine to perform calculations that any other programmable computer is capable of. An example of this is the EVM.