查询词典 Turing

Turing machine, random access machine, primitive recursive, cellular automaton, finite state machine, cell probe model, pointer machine, alternation, alternating Turing machine, nondeterministic Turing machine, oracle Turing machine, probabilistic Turing machine, universal Turing machine, quantum computation, parallel models: multiprocessor model, work-depth model, parallel random-access machine, shared memory.

图灵机，随机存取机，原始递归，元胞自动机，有限状态机，细胞探针模型，指针机，交替轮流进行，图灵机，非确定性图灵机，甲骨文图灵机，概率图灵机，通用图灵机，量子计算，并行型号：多模式，工作深入模型，并行随机存取机，共享内存。

Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted "Turing" version of the Church Turing thesis, namely that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.

图灵机被公认为现代计算机的原型，这台机器可以读入一系列的零和一，这些数字代表了解决某一问题所需要的步骤，按这个步骤走下去，就可以解决某一特定的问题。

Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted "Turing" version of the Church Turing thesis, namely that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine.

他对计算机的重要贡献在于他提出的有限状态自动机也就是图灵机的概念，对于人工智能，它提出了重要的衡量标准&图灵测试&，如果有机器能够通过图灵测试，那他就是一个完全意义上的智能机，和人没有区别了。

Some priori estimates, Turing instability and global stability of positive constant steady-state solution are obtained by comparison principle, operator spectrum theory and Turing theory.

利用比较原理，算子谱理论及Turing理论，得到了正解的一些先验估计，正常数平衡态解的Turing不稳定性及正常数平衡态解的一致渐近稳定性。

In section one, we introduce some background of the topic, in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic- the algebraic structure of the plus cupping Turing degrees, in section three, we outline the basic principles of the priority tree argument, one of the main frameworks and tools of theorem proving in computability theory, and in section four, we prove a new result concerning the algebraic structure of the plus cupping Turing degrees that there exist two computably enumerable degrees a, b such that a, b ? PC, and the join a V b of a and b is high.

度结合为0′。本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题—加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a，b，满足a，b∈PC，而且a和b的并a∨b是一个高度。

But we will see that the Turing machine and the RAM are equivalent from many points of view; what is most important, the same functions are computable on Turing machines and on the RAM.

但是，我们将看到，图灵机和内存相当于从许多观点；什么是最重要的是，同样的职能是可计算的图灵机和内存。

C language MATLAB the Turing Machine animation demo program, based on the Turing machine to achieve the basic principles.

用C语言+MATLAB实现的图灵机的动画演示程序，基于图灵机的基本原理实现。

"I don't know whether I am Turing dreaming that I am a machine, or a machi..: reaming that I am Turing!"

&我不知道是图灵梦见自己变成机器还是机器梦见自己变成图灵。&

A friend of the young man burgled Turing's house one night, and in the subsequent police investigation Turing naively spoke of having had sexual relations with the burglar's friend.

那个年青人的一位朋友在一个晚上到图灵家偷窃，在随后的警察调查中，图灵天真地说到曾经与这个夜盗的朋友有性关系。

Turing Award Citation): For fundamental contributions to programming language design and the definition of Algol 60, to compiler design, and to the art and practice of computer programming.

(授予 Peter Naur 图灵奖以表彰其)对 Algol 60 编程语言的设计与定义，对编译器设计和计算机编程领域的理论与实践的基础性贡献。

A backer of an Afghan law that critics say legalizes marital rape has rejected the international outcry as foreign meddling.

饱受批评的一项法律的拥护者说合法化的婚内暴力不会受国际舆论的干涉。

Years ago, a ancient Egyptian fleet went to the Land of punt for seeking a kind of flavor named "myrrh", and aromatic plants which has dense exotic style for the queen Hatshepsut.

3500年前的一个古埃及的舰队到&彭特之地&寻找一种叫没药的香料。