First We need to define our Turing machine rules.

首先我们需要定义我们的图灵机规则。

That's what made the Turing machine so useful in answering Hilbert's question on decidability.

这就是图灵机在回答希尔伯特关于可判定性的问题时如此有用的原因。

When a Turing machine halts, the program has finished running and the tape is the output.

当图灵机停止时，程序已经完成运行，磁带是输出。

He proposed a hypothetical computing machine, which we now call a Turing Machine.

他提出了一种假想的计算机器，我们现在称之为图灵机。

Here's a tiny fragment of it shown in terms of Turing machines.

这是以图灵机形式显示的一小部分。

But sometimes a Turing machine never halts.

但有时图灵机永远不会停止。

In fact in terms of what it can and cannot compute, there's no computer more powerful than a Turing machine.

事实上，就它能计算什么和不能计算什么而言，没有比图灵机更强大的计算机了。

To find one Turing designed another Turing machine that built on top of H.

为了找到一个图灵设计了另一个构建在 H.

To this day, the best computational systems are those that can do everything a Turing machine can.

直到今天，最好的计算系统是那些可以做图灵机能做的一切的系统。

That's how Turing machines work pretty simple right, so you might be wondering why there's such a big deal.

这就是图灵机的工作方式，非常简单，所以您可能想知道为什么会有这么大的问题。