In computability theory, there is a closely related concept known as Turing equivalence.
在可计算理论里，有一个很相关的概念叫图灵等价。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
The technical details of things like Turing completeness and theories of computability are beyond most of them.
如图灵可计算的完整性和理论的东西的技术细节超出了大多数。
The traditional theory of computability is based on Turing machines.
传统的可计算性理论以图灵机为基础模型。
The traditional theory of computability is based on Turing machines.
传统的可计算性理论以图灵机为基础模型。
应用推荐