查询词典 Turing

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 编程语言的设计与定义，对编译器设计和计算机编程领域的理论与实践的基础性贡献。

It is proved that if'sparse NP complete sets under polynomial-time Turing reductions exist'then 'SAT is polynomial-time non-adaptively search reducible to decision', and that if 'P is not equal to NP'then either'SAT is not polynomial-time non-adaptively search reducible to decision'or'SAT is not polynomial-time truth-table reducible to bounded approximable sets', and that if'P is not equal to NP'then'sparse complete sets for NP under polynomial-time disjunctive reductions do not exist'.

因为用现有的证明技术不可能绝对地解决这个假设，本文研究了这个假设与其他关于SAT结构性质的假设之间的关系，证明了如果'NP有多项式时间图灵归约下的稀疏完全集'则'SAT是多项式时间并行地搜索归约为判定'，以及如果假设'P不等于NP'，则要么'SAT不是多项式时间并行地搜索归约为判定'，要么'SAT不能用多项式时间真值表归约归约为有界可近似集'。

Turing Award Citation): For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes.

( 授予 Richard Hamming 图灵奖以表彰其在)数字方法，自动编码系统和错误检测和错误纠正编码领域的杰出贡献。

Turing was instrumental in decoding the Enigma - using a machine of his own design called the 'Bombe'.

图灵是有助于破译Enigma的-使用他自己设计的、称为"甜点心"的机器。

Turing is most famous for his work in helping create the "bombe" that cracked messages enciphered with the German Enigma machines.

图灵是在帮助创立"炸弹"来破译德国恩尼格玛密码机的译码信息工作中最为出名的。

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.

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

Neither the killing of Mr Zarqawi nor any breakthrough on the political front will stop the insurgency and the fratricidal murders in their tracks.

在对危险的南部地区访问时，他斥责什叶派民兵领导人对中央集权的挑衅行为。

In fact,I've got him on the satellite mobile right now.

实际上 我们已接通卫星可视电话了