全部

1·No one wants to program a Turing machine.

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

2·In other words, the system and the universal Turing machine can emulate each other.

换言之，此系统可与通用图灵机互相模拟。

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

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

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

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

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

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

6·The production line include ZC auto washer, GD balanced pressure filer, WFG cap turing machine, SSJ carrying machine etc.

本生产流水线有ZC型自动冲瓶机、GD型等压灌装机、WFG型旋盖机及SSJ型输送机等系列产品组成。

7·In 2006 moved to Sanya City, Hainan Province, working in large enterprises directly (Turing machine), he served as chief economist, retired in 1987.

2006年移居海南省三亚市，工作于大型中直企业(林机)，任总经济师，1987年退休。

8·Thus, a Turing-complete system is one that can simulate a Turing machine, but the term is most often used to mean Turing equivalent to a Turing machine.

因此，一个图灵完备的系统可以模拟图灵机，但是这个术语(即图灵等价)常常被用来指与图灵机等价。

9·Thus, a Turing-complete system is one that can simulate a Turing machine, but the term is most often used to mean Turing equivalent to a Turing machine.

是以，一个图灵完全的体系可以模仿图灵机，然则这个术语（即图灵等价）经常被用来指与图灵机等价。

10·Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.

可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。