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.

图灵想知道一台机器是否能自己思考，并欺骗别人，让他们相信自己正在与另一个人交谈。

It's called Turing compatibility.

它叫做图灵兼容性。

Nor I half turn to go, yet Turing stay.

我不会转身走去，而又半途转身停留。

No one wants to program a Turing machine.

没人想在图灵机上写程序。

Turing pattern: Renders a kind of Turing pattern.

Turing Pattern：呈现一种图灵模式。

The Turing test obviously has its limitations.

显然，图灵测试也有其局限性。

Alan Turing was right. Being digital is incredibly interesting.

阿兰·图灵是对的，数字的确令人难以置信的有趣。

Or say you're more historically savvy, might you venture Alan Turing?

或者你更了解历史，敢大胆的说是阿兰·图灵？

But a computer that can pass an unrestricted Turing test could do it easily.

但是，一个能够通过不受限图灵测试的计算机就可以轻易完成此事。

Gremlin is a Turing Complete programming language useful for working with graphs.

Gremlin是操作图表的一个非常有用的图灵完备的编程语言。

Some argue that he, not Turing or Zuse, is the true father of the modern computer.

有人认为，与其说是图灵或祖萨，不如说是他才是真正的现代电脑之父。

That, at least, was the test proposed in 1950 by Alan Turing, a British mathematician.

早在1950年，英国数学家Alan Turing就曾提出过人工智能这一说。

Most of us remember Alan Turing as a pioneer of computing and machine intelligence.

大多数人都把阿兰·图灵看做一位计算机、机器智能方面的先驱者。

In computability theory, there is a closely related concept known as Turing equivalence.

在可计算理论里，有一个很相关的概念叫图灵等价。

That is, they are capable of computation in the same manner as a universal Turing machine.

也就是说，他们是在计算能力作为一个通用图灵机的方式相同。

Throughout his life, Turing was fascinated by the organized forms and shapes of biological organisms.

在他的整个人生，图灵都对生物体有组织的形式和形状着迷。

The most famous test for artificial intelligence is that devised by Alan Turing, a British computing pioneer.

最著名的人工智力测试是由英国计算科学先驱阿兰·图灵(Alan Turing)设计的。

We need to draw the line of JVM-equivalence in the sand, closer to pragmatic needs than Turing-equivalence.

我们需要在地上为JVM等效画条线，一条更接近实用需求而远离图灵等效的线。

In 1982 Richard Feynman suggested that the venerable Turing machine might not be as powerful as people thought.

年richard Feynman提出，值得尊敬的Turing机器的功能也许并没有人们所想的那么强大。

Nevertheless, Turing provided an account of morphogenesis that required nothing more than chemistry and physics.

尽管如此，图灵还是提出了一种仅仅需要化学和物理(知识)来对形态的解释。

Turing over, sitting up by himself, and being able to grasp a toy within reach are all milestones in baby development.

翻滚，能自己坐起来，在够得着的范围内伸手抓到一个玩具，这些在宝宝发育阶段中都是一个里程碑。

Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.

此外，Wolfram和Matthew Cook还证明了110规则在计算上等同于一个一般性图灵机。

An unscheduled call that rings on my phone fails the conversational Turing test: it's almost certainly junk, so I ignore it.

来安排。一个未经预约就打到我手机上的电话通过不了对话图灵测试(conversational Turing test)：这个电话几乎肯定是垃圾电话，因此我忽略它。

Having first raised, in Council, the idea of establishing a Turing Award, I have felt a fatherly concern about each selection.

设立图灵奖的想法是我最先在(acm)理事会上提出的，我每次都以一种父亲似的态度关注评选。

It stands for "completely automated public Turing test to tell computers and humans apart"; no, the acronym doesn't really fit.

它是“completely automated public Turing test to tell computers and humans apart”的首字母，意为“区分人与计算机的全自动公众图灵测试”；当然，首字母缩写并不是完全对应的。

All languages are equally powerful in the sense of being Turing equivalent, but that's not the sense of the word programmers care about.

所有语言在图灵相等这一层上是一样强大的。但是这和程序员的意思不一样。