neural turing machines 神经网络图灵机
Multitape Turing Machines 多带图灵机
deterministic turing machines 确定性图灵机
nondeterministic turing machines 非确定性图灵机
Deterministic Fuzzy Turing Machines 确定型模糊图灵机
halting problem of turing machines 图灵机的停机问题
Nondeterministic Fuzzy Turing Machines 非确定型模糊图灵机
·2,447,543篇论文数据，部分数据来源于NoteExpress
The traditional theory of computability is based on Turing machines.
传统的可计算性理论以图灵机为基础模型。
In the field of complexity theory, most of complexity classes are described according to their acceptance by different kinds of Turing machines.
在计算复杂性领域里，大多数复杂类都是按照接受它们的图灵机而加以描述的。
The general consensus was, because programming languages are all Turing machines and therefore essentially equivalent, they do not ultimately matter.
大家一致的共识是，因为编程语言都是图灵机，因此本质上是相同的，不会有重大的问题。
应用推荐