这部历史惊悚片讲述的是人工智能之父、英国计算机科学家艾伦·图灵的故事。
This historical thriller is about British computer scientist, Alan Turing, the father of artificial intelligence.
图灵想知道一台机器是否能自己思考，并欺骗别人，让他们相信自己正在与另一个人交谈。
Turing wanted to know if a machine could think for itself and trick someone into believing they were having a conversation with another person.
它叫做图灵兼容性。
或者你更了解历史，敢大胆的说是阿兰·图灵？
Or say you're more historically savvy, might you venture Alan Turing?
阿兰·图灵是对的，数字的确令人难以置信的有趣。
Alan Turing was right. Being digital is incredibly interesting.
TuringPattern：呈现一种图灵模式。
在可计算理论里，有一个很相关的概念叫图灵等价。
In computability theory, there is a closely related concept known as Turing equivalence.
图灵的工作提供了一种生物自我组织的最早模式之一。
Turing's work provided one of the very first models of biological self-organization.
图灵的理论提供了有序如何能自主产生的最早例子之一。
Turing's theory provided one of the first examples of how order could arise spontaneously.
Gremlin是操作图表的一个非常有用的图灵完备的编程语言。
Gremlin is a Turing Complete programming language useful for working with graphs.
在他的整个人生，图灵都对生物体有组织的形式和形状着迷。
Throughout his life, Turing was fascinated by the organized forms and shapes of biological organisms.
有人认为，与其说是图灵或祖萨，不如说是他才是真正的现代电脑之父。
Some argue that he, not Turing or Zuse, is the true father of the modern computer.
科学家们将图灵描述为英国英雄和现代最杰出的数学家之一。
The scientists described him as a British hero and one of the most brilliant mathematicians of the modern era.
在那次图灵测试中，人们采用了各种手段去让竞争机器出差错。
Various ploys are used to try to trip up the machines competing in the Turing test.
也就是说，他们是在计算能力作为一个通用图灵机的方式相同。
That is, they are capable of computation in the same manner as a universal Turing machine.
所有语言在图灵相等这一层上是一样强大的。但是这和程序员的意思不一样。
All languages are equally powerful in the sense of being Turing equivalent, but that's not the sense of the word programmers care about.
在这部意义重大而深远的影片中，奈特莉饰演图灵的朋友琼•克拉克。
Knightley plays Joan Clarke, a friend of Turing, in a film those involved called profound and important.
尽管如此，图灵还是提出了一种仅仅需要化学和物理(知识)来对形态的解释。
Nevertheless, Turing provided an account of morphogenesis that required nothing more than chemistry and physics.
大家一致的共识是，因为编程语言都是图灵机，因此本质上是相同的，不会有重大的问题。
The general consensus was, because programming languages are all Turing machines and therefore essentially equivalent, they do not ultimately matter.
我们需要在地上为JVM等效画条线，一条更接近实用需求而远离图灵等效的线。
We need to draw the line of JVM-equivalence in the sand, closer to pragmatic needs than Turing-equivalence.
因为这些语言是图灵完整的(请参阅参考资料)，基本上能够检查可用于字符串的任何条件。
Because these languages are Turing complete (see Resources), they can verify essentially any condition that you might impose on the strings.
xml生存在程序员的图灵完整语言和人文学者的WYSIWYG编辑器之间的无人小岛上。
XML lives in a no-man's land between the Turing complete languages of the programmers and the WYSIWYG editors of the humanities scholars.
最著名的人工智力测试是由英国计算科学先驱阿兰·图灵(Alan Turing)设计的。
The most famous test for artificial intelligence is that devised by Alan Turing, a British computing pioneer.
在这个领域，图灵的贡献将永久延续，他将永远被看做是人工智能方面的科学巨人之一。
Turing's contributions in this area will endure forever and he will always be regarded as one of the intellectual giants of artificial intelligence.
回到1950年，阿兰·图灵推荐将图灵测试作为一种判定实体是否是智能的实体的方法。
As far back as 1950, Alan Turing proposed the Turing Test as a method of determining whether an entity should be treated as intelligent.
一支东德特拉比车队穿过位于东德的图灵根州和西德巴伐利亚州之间的鲁道夫施泰因检查站。
A column of East German Trabants cross the border at the Rudolphstein checkpoint between the East German state of Thuringia and Bavaria.
阿兰·图灵是英国的一位科学家、数学家、逻辑学家和译码者，可以说是20世纪英国最伟大的科学家。
Alan Turing was an English scientist, mathematician, logician, and cryptographer, and arguably the greatest British scientist of the 20th century.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
应用推荐