1·This historical thriller is about British computer scientist, Alan Turing, the father of artificial intelligence.
这部历史惊悚片讲述的是人工智能之父、英国计算机科学家艾伦·图灵的故事。
2·Turing wanted to know if a machine could think for itself and trick someone into believing they were having a conversation with another person.
图灵想知道一台机器是否能自己思考，并欺骗别人，让他们相信自己正在与另一个人交谈。
3·It's called Turing compatibility.
它叫做图灵兼容性。
4·Nor I half turn to go, yet Turing stay.
我不会转身走去，而又半途转身停留。
5·No one wants to program a Turing machine.
没人想在图灵机上写程序。
6·Turing pattern: Renders a kind of Turing pattern.
Turing Pattern：呈现一种图灵模式。
7·The Turing test obviously has its limitations.
显然，图灵测试也有其局限性。
8·Alan Turing was right. Being digital is incredibly interesting.
阿兰·图灵是对的，数字的确令人难以置信的有趣。
9·Or say you're more historically savvy, might you venture Alan Turing?
或者你更了解历史，敢大胆的说是阿兰·图灵？
10·But a computer that can pass an unrestricted Turing test could do it easily.
但是，一个能够通过不受限图灵测试的计算机就可以轻易完成此事。
1·Turing wanted to know if a machine could think for itself and trick someone into believing they were having a conversation with another person.
图灵想知道一台机器是否能自己思考，并欺骗别人，让他们相信自己正在与另一个人交谈。
2·Because these languages are Turing complete (see Resources), they can verify essentially any condition that you might impose on the strings.
因为这些语言是图灵完整的(请参阅参考资料)，基本上能够检查可用于字符串的任何条件。
3·All languages are equally powerful in the sense of being Turing equivalent, but that's not the sense of the word programmers care about.
所有语言在图灵相等这一层上是一样强大的。但是这和程序员的意思不一样。
4·Alan Turing was an English scientist, mathematician, logician, and cryptographer, and arguably the greatest British scientist of the 20th century.
阿兰·图灵是英国的一位科学家、数学家、逻辑学家和译码者，可以说是20世纪英国最伟大的科学家。
5·It's called Turing compatibility.
它叫做图灵兼容性。
1·Often considered to be the father of modern computer science, Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine.
通常认为他是现代计算机科学之父，图灵利用图灵机的发明提供了一套影响深远的关于算法和计算概念的规范。
2·The general consensus was, because programming languages are all Turing machines and therefore essentially equivalent, they do not ultimately matter.
大家一致的共识是，因为编程语言都是图灵机，因此本质上是相同的，不会有重大的问题。
3·Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.
此外，Wolfram和Matthew Cook还证明了110规则在计算上等同于一个一般性图灵机。
4·Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
5·In the field of complexity theory, most of complexity classes are described according to their acceptance by different kinds of Turing machines.
在计算复杂性领域里，大多数复杂类都是按照接受它们的图灵机而加以描述的。