| 释义 |
tu·ring machine AHDˈtyu̇riŋ- 短语⁵⁹⁹⁶⁵
基本例句
图灵机,图录机,图灵计算机
Moreover, Wolfram, and Matthew Cook have proven that rule110 is computationally equivalent to a universal Turing machine.
此外， Wolfram和 Matthew Cook还证明了110规则在计算上等同于一个一般性图灵机。 ibm
No one wants to program a Turing machine.
没人想在图灵机上写程序。 yeeyan
That is, they are capable of computation in the same manner as a universal Turing machine.
也就是说，他们是在计算能力作为一个通用图灵机的方式相同。 dxy
That is, you can use rule110 to compute any function that a universal Turing machine can compute.
即，可以用110规则计算任何一般性图灵机可以计算的函数。 ibm |