图灵机用英语怎么说,图灵机的英文翻译


词语导航

基本信息

词语:图灵机

繁体:圖靈機

拼音:tú líng jī

英语翻译

【计】 Turing; Turing machine

相关词条

1.turingmachine  2.turringmachine  

分词翻译

图的英语翻译:

chart; drawing; fig.; map; plot; picture; intention; attempt; plan
【计】 diagram; graphtyper
【化】 diagram
【医】 chart; column diagram; diagram; graph; map; picture; schema; scheme
sheet

灵机的英语翻译:

brainwave; sudden wit

翻译例句

1. 没人想在图灵机上写程序。

No one wants to program a Turing machine.

2. 传统的可计算性理论以图灵机为基础模型。

The traditional theory of computability is based on Turing machines.

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

In other words, the system and the universal Turing machine can emulate each other.

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

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

5. 好的,这个图灵机建议,这和我们每天彼此适应的标准不是一样。

Well, Turing suggested, isn"t that the same criterion we apply to each other every day?

6. 大家一致的共识是,因为编程语言都是图灵机,因此本质上是相同的,不会有重大的问题。

The general consensus was, because programming languages are all Turing machines and therefore essentially equivalent, they do not ultimately matter.

7. 在计算复杂性领域里,大多数复杂类都是按照接受它们的图灵机而加以描述的。

In the field of complexity theory, most of complexity classes are described according to their acceptance by different kinds of Turing machines.

8. 在这个假定中,其实图灵机真正想做的就是提出这个问题:“机器可以思考吗?”

What Turing really wanted to do with this scenario was suggest that the question "Can machines think?"

9. 可计算性理论探讨了计算机的各种理论模型的局限性,包括已知的最强大的模式,-图灵机。

Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.

10. 图灵机模型是现代计算机科学的理论基础,学习图灵机理论对于研究计算机软件理论有重要意义。

TM model is the academic foundation of modern computer science. Studying the TM theory is important to research the computer software theory.

11. 图灵机模型是现代计算机科学的理论基础,学习图灵机理论对于研究计算机理论有着重要的意义。

TM model is the academic foundation of modern computer science. Studying the TM theory is important to research the computer theory.

12. 因此,一个图灵完备的系统可以模拟图灵机,但是这个术语(即图灵等价)常常被用来指与图灵机等价。

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.

13. 是以,一个图灵完全的体系可以模仿图灵机,然则这个术语(即图灵等价)经常被用来指与图灵机等价。

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.www.weNtiYi.COm

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

Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.

15. 在此基础上,通过分析通用图灵机带头移动的次数,讨论了通用图灵机上任一求解RHC的算法的复杂性。

Secondly, we discuss the complexity any algorithm solving RHC presents by counting the moving times of the tape head on turning machine.

16. 通常认为他是现代计算机科学之父,图灵利用图灵机的发明提供了一套影响深远的关于算法和计算概念的规范。

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.

17. 第三,它给我们带来了一个简单的,可以有了适当的数据后,可以用于进行任何数量的任务的通用图灵机器。

Third, it gives us a simple universal machine that can be applied to any number of tasks with the right data.

18. 通过对图灵机状态跳转函数的思索和状态树的构造,得到对于任意状态节点的最大后缀状态,从而大大地加快了识别器的识别效率。

And it also gets the longest suffix state in state tree derived through the constructing of the state-jump function and effectively speeds up the character matching.

19. 最著名的有限状态机可能是阿兰·图灵在1936年发表的论文《OnComputableNumbers》上写下的的猜想——图灵机。

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."

20. 最著名的有限状态机可能是阿兰·图灵在1936年发表的论文《OnComputableNumbers》上写下的的猜想——图灵机。

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."

版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!