在可计算性理论里，如果一系列操作数据的规则（如指令集、编程语言、细胞自动机）可以用来模拟单带图灵机，那幺它是图灵完备的。这个词源于引入图灵机概念的数学家艾伦·图灵。

虽然图灵机会受到存储能力的物理限制，图灵完全性通常指「具有无限存储能力的通用物理机器或编程语言」。

In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine. The concept is named after English mathematician Alan Turing. A classic example is lambda calculus.