All languages are equally powerful in the sense of being Turing equivalent, but that's not the sense of the word programmers care about.
所有语言在图灵相等这一层上是一样强大的。但是这和程序员的意思不一样。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
In 1982 Richard Feynman suggested that the venerable Turing machine might not be as powerful as people thought.
年richard Feynman提出，值得尊敬的Turing机器的功能也许并没有人们所想的那么强大。
应用推荐