查询词典 Turing computability

Topics covered include: programming and computability theory based on a term-rewriting,"substitution" model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem.

其所包含的主题：程序和运算理论是基于根据算数和具有一些副作用的计划纲要的条款重写和"代入"模式之上的、关于代数学计算的算数：关于代数学计算和术语重写理论的评价方案作计划、应用程序自己和说明的自相矛盾到形式上的程序语义、关于计划Halting 问题的不可判定性、可递归可列举集合的属性、导致对于等同计划的不完整规则、对于逻辑和证明程序的规范和Hilbert的第十问题。

The profound deductive basis greatly strengthens the operationality, computability, and logical necessity of TLG, and thus efficiently excludes the unreasonable stipulatory practice (such as the stipulation of transformational rules in Transformational Generative Grammar) in the study of natural language.

类型-逻辑语法通过语义类型的媒介作用，把句法范畴同与之具有相同语义类型的λ-词项关联起来，每一条句法规则都对应于一条语义规则，句法和语义同时生成，从而实现了其句法理论和语义理论的完全同构对应，严格遵循了意义组合原则。

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.

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

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.

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

If I didn't care what anyone thought, I would.....

如果我不介意别人怎么看，我会。。。。

In recent decades, Chile has mandated earthquake-proofing for new structures, requiring that materials like rubber and features like counterweights be built into the architectural designs to allow buildings to bend and sway during temblors rather than break.

在最近数十年里，智利已经为兴建防震的新土建结构而对建筑材料提出要求，需要的材料类似于橡胶，而特性就象运用在建筑设计中的平衡物体，一旦应用以后，当地震发生时建筑就能弯曲摇摆。