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.
大家一致的共识是，因为编程语言都是图灵机，因此本质上是相同的，不会有重大的问题。
Various ploys are used to try to trip up the machines competing in the Turing test.
在那次图灵测试中，人们采用了各种手段去让竞争机器出差错。
What Turing really wanted to do with this scenario was suggest that the question "Can machines think?"
在这个假定中，其实图灵机真正想做的就是提出这个问题：“机器可以思考吗？”
In the article, Turing argues that any meaningful discussion of machine intelligence demands an operational definition of the concept of thinking, in humans as well as in machines.
在该文章中，图灵认为任何有意义的机器智能讨论对人和对机器都都要求一个对思考这一概念的ke操作定义。
What Turing really wanted to do with this scenario was suggest that the question "Can machines think?" is much too vague to be useful.
Turing的这个实验真正的用意是来证明“机器到底会不会思考”这个问题太模糊而不具有价值。
What Turing really wanted to do with this scenario was suggest that the question "Can machines think?" is much too vague to be useful.
Turing的这个实验真正的用意是来证明“机器到底会不会思考”这个问题太模糊而不具有价值。
应用推荐