查询词典 Turing

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.

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

The first British "Bombe" machine was designed by Alan Turing, a genius mathematician which developed the theoretical model of the computer, and served during World War 2 as a senior code breaker at the British code breaking center at Bletchley Park.

英国天才数学家阿兰。图灵设计出了第一台英国制"图灵炸彈"。他是现代计算机理论模型的奠基人。在二次世界大战时，他作为高级密码分析人员在当时英国的密码破译中心----布莱特利公园工作。

By mid 1940, thanks to the Polish knowledge and the first type of the British "Bombe" machine designed by Alan Turing, the British code breakers at Bletchley Park could read some German army Enigma messages within 24 hours, but the most important German Enigma messages, those of the German U-boat submarines, could not be deciphered.

至1940年夏，多亏了波兰人提供的情报和阿兰。图灵从新设计的"图灵炸彈"，在布莱特利公园工作的英国密码分析人员可以在24小时内破译相当部分的恩尼格码密文。但是那些对英国人最为重要的、 N粹海军潜艇部队的恩尼格码密文仍然无法被破译。

Building on Turing's contribution, Shannon had demonstrated how Boolean algebra and logic could be used in the analysis and synthesis of switching and computer circuits.

在图灵理论的基础之上，香农演示了布尔代数与逻辑如何用于开关与计算机电路的分析与综合。

Hill, codebreaker Alan Turing and Christopher Cockerell, inventor of the hovercraft.

希尔，译码专家阿兰。德宁，气垫船发明者克里斯多夫。科克雷尔。

The technical details of things like Turing completeness and theories of computability are beyond most of them.

如图灵可计算的完整性和理论的东西的技术细节超出了大多数。

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

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

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。