That is, they are capable of computation in the same manner as a universal Turing machine.
也就是说,他们是在计算能力作为一个通用图灵机的方式相同。
Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.
此外,Wolfram和Matthew Cook还证明了110规则在计算上等同于一个一般性图灵机。
应用推荐