universal Turing machine

a computer viruses'infection model based on an expanded universal turing machine

基于扩展通用图灵机的计算机病毒传染模型

in other words, the system and the universal turing machine can emulate each other.

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

Ironically, it was on 20 September 1948 that von Neumann gave a first published lecture on the 'theory of automata'-in effect, the theory of discrete controlling machines-in which he drew attention, after eleven years, to the fundamental importance of the Universal Turing Machine.

讽刺的是，1948年9月20日，冯·诺伊曼举办了第一场关于“自动机理论”的公开讲座（实际上可以称为“离散静态机理论”），在其中他强调，通用图灵机具有非常本质的重要性。

moreover, wolfram, and matthew cook have proven that rule 110 is computationally equivalent to a universal turing machine.

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

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

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

It was equivalent to the freedom allowed to Turing machines, that of changing 'configuration' according to what was read on the tape, and it was this that made Babbage's planned machine a universal one, as he himself was well aware.

而这种自主性，与图灵机是等价的，图灵机就是根据纸带上的指令来切换机器的状态。巴贝奇很清楚，正是这一点，使他的机器具有通用的特性。

that is, you can use rule 110 to compute any function that a universal turing machine can compute.

即，可以用110规则计算任何一般性图灵机可以计算的函数。