What Does It Mean for a System to Compute Anything?
Turing completeness: the property of a computational system that can simulate any Turing machine — and therefore, in principle, compute any computable function.
Turing completeness: the property of a computational system that can simulate any Turing machine — and therefore, in principle, compute any computable function.