A term used to describe a system or language that is capable of performing any computation that a Turing machine can, often used in the context of programming languages and computational models.

"Lambda calculus is Turing-complete, meaning it can express any computable function."