Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the 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》上写下的的猜想——图灵机。
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 1982 Richard Feynman suggested that the venerable Turing machine might not be as powerful as people thought.
年richardFeynman提出，值得尊敬的Turing机器的功能也许并没有人们所想的那么强大。
Perhaps if Turing were alive today, he would define artificial intelligence as the inability of a computer to tell whether another machine is human!
如果图灵今天还活着的话，也许他会把人工智能形容成一个不能识别另一台电脑是不是人类的无能计算机！
That is, they are capable of computation in the same manner as a universal Turing machine.
也就是说，他们是在计算能力作为一个通用图灵机的方式相同。
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.
因此，一个图灵完备的系统可以模拟图灵机，但是这个术语(即图灵等价)常常被用来指与图灵机等价。
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.
是以，一个图灵完全的体系可以模仿图灵机，然则这个术语（即图灵等价）经常被用来指与图灵机等价。
In the article, Turing argues that any meaningful discussion of machine intelligence demands an operational definition of the concept of thinking, in humans as well as in machines.
在该文章中，图灵认为任何有意义的机器智能讨论对人和对机器都都要求一个对思考这一概念的ke操作定义。
The production line include ZC auto washer, GD balanced pressure filer, WFG cap turing machine, SSJ carrying machine etc.
本生产流水线有ZC型自动冲瓶机、GD型等压灌装机、WFG型旋盖机及SSJ型输送机等系列产品组成。
Jeopardy-playing computer seems like a remarkable accomplishment, not too short of having a machine pass the famous Turing Test.
一台能过参加Jeopardy的计算机似乎是一个了不起的成就，似乎就距离一台通过著名图灵测试的机器不远了。
In other words, the system and the universal Turing machine can emulate each other.
换言之，此系统可与通用图灵机互相模拟。
In other words, the system and the universal Turing machine can emulate each other.
换言之，此系统可与通用图灵机互相模拟。
应用推荐