No one wants to program a Turing machine.
没人想在图灵机上写程序。
Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.
此外，Wolfram和MatthewCook还证明了110规则在计算上等同于一个一般性图灵机。
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.
通常认为他是现代计算机科学之父，图灵利用图灵机的发明提供了一套影响深远的关于算法和计算概念的规范。
In other words, the system and the universal Turing machine can emulate each other.
换言之，此系统可与通用图灵机互相模拟。
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.
因此，一个图灵完备的系统可以模拟图灵机，但是这个术语(即图灵等价)常常被用来指与图灵机等价。
The most famous finite state machine is probably Alan Turing's hypothetical device: the Turing machine, which he wrote about in his 1936 paper, "On Computable Numbers."
最著名的有限状态机可能是阿兰·图灵在1936年发表的论文《OnComputableNumbers》上写下的的猜想——图灵机。
The most famous finite state machine is probably Alan Turing's hypothetical device: the Turing machine, which he wrote about in his 1936 paper, "On Computable Numbers."
最著名的有限状态机可能是阿兰·图灵在1936年发表的论文《OnComputableNumbers》上写下的的猜想——图灵机。
应用推荐