图灵

的标题下构造了一个递归OracleA，并且证明UP~A无图灵完全语言。

The author constructs a recursive Oracle A such that UP ~ A has no Turing complete sets .

它是一种人工智能形式，只需要再向前走几步，就是一款能通过图灵测试（Turingtest，一个关于机器人是否具有人类智能的著名判断原则&译注）的程序了。

It 's a form of AI that takes a few more steps closer to an app that could pass the Turing test .

在图灵参加纳菲尔德科学基金的一场会议时，考虑到他的情况，P·B·梅达沃提出一项研究计划，通过对雄性动物注射雌性激素，观察其行为模式的变化，研究其神经生理机制。

At the Nuffield Foundation conference that Alan attended , P.B. Medawar had proposed a programme of experiments on male animals , injecting oestrogen in order to reveal the neuro-physiological mechanism through the consequent alteration in behaviour patterns .

报告了关于少儿图灵测试（CTT）的一项研究工作。

This paper presents a research work on children Turing test ( CTT ) .

但是黛丽拉仍是ACE计划的前期基础的一部分，是图灵的逻辑思想的精髓所在。

But Delilah had been part of the preparations for the ACE , and this , Alan Turing 's logical Overlord , was what mattered .

他们用oracle图灵机（OTM）模型给出了图灵归约的形式定义。

They gave the formal definition of Turing reduction in terms of oracle Turing machine ( OTM ) .

也就是说，如果有足够的内存，那么XSLT可以完成其他任何图灵完成语言（如C++）所能完成的计算。

This means that given sufficient memory , XSLT can calculate anything any other Turing-complete language ( such as C + + ) can calculate .

1946年11月20日，图灵回信给W·罗斯·阿什比，这是一位神经学家，他十分急切地希望推动脑功能的机械模型的发展。图灵在信中如是写道：

On 20 November 1946 he had replied to an enquiry from W. Ross Ashby , a neurologist eager to make progress with mechanical models of cerebral function , in the following terms :

图灵想到，要“维护一组精简的指令表，在需要时再对其进行扩展”，而这个扩展工作可以由机器自动完成，依靠一个叫做EXPAND的表。

Thus he imagined ' keeping the instruction tables in an abbreviated form , and expanding each table whenever we want it ' - the work being done by the machine itself , using a table called EXPAND .

图灵奖获得者JimGray提出了一条经验定律：网络环境下每18个月产生的数据量等于有史以来数据量之和。

Turing Award winner Jim Gray proposed a piece of new experience laws : In a network environment , the amount of data generated every 18 months is equal to the sum of historical data .

图灵充分利用电子技术，使ACE的速度高达每秒100万次脉冲注。

This was reflected also in the fact that Alan planned the pulse rate of the ACE to be a million a second , straining electronic technology to the full .

昨天已有30505个签名的请愿书是计算机科学家约翰·格雷汉姆（JohnGraham）的主意，他也写信给英国女王要求追封图灵为复活的骑士。

The petition , which yesterday had30,805 signatures , was the idea of computer scientist John Graham-Cumming , who has also written to the Queen to request Turing be awarded a posthumous knighthood .

Gremlin是操作图表的一个非常有用的图灵完备的编程语言。

Gremlin is a Turing Complete programming language useful for working with graphs .

还基于经典计算模型图灵（Turing）机和形式系统序列及其极限，提出了收敛无穷计算的模型，称为过程模式。

A computation model , called procedure scheme , for convergent infinite computations was proposed , on the basis of classical Turing machine and formal theory sequences and their limits .

和传统ROP不同的是，EnglishROP是由可打印的地址和数据组成的，因此本文首先说明了EnglishROP的图灵完备性，然后详细介绍了EnglishROP的构造过程。

Different from traditional ROP , English ROP is composed of printable gadgets and printable data . In this paper , we first prove that English ROP is turing-completeness , and then propose an algorithm for automatically constructing English ROP .

S.Johnson在[3]中引入图灵归约的概念，利用这个概念把NP完全性理论推广到包括组合最优化问题在内的更广的一类问题上。

S. Johnson introduced the concept of Turing reduction and by using this concept intended to make the theory of NP-completeness applicable to an extended class of problems including the combinatorial optimal problems in [ 3 ] .

然而，ACE的设计实际上是自洽的，其根源并不是EDVAC，而是图灵自己的通用机。

However , the ACE proposal was effectively self-contained , and its roots lay not in the EDVAC , but in his own universal machine .

这次图灵应邀参加了会议，在被沃默斯利介绍成令人生畏的“数理逻辑领域顶级专家”之后，他尽量简单地介绍了ACE。

This time Alan was invited to attend , and after being dauntingly introduced by Womersley as ' an expert in the field of mathematical logic ' , he did his best to explain the ACE as simply as possible .

但是XQuery是图灵完备的（Turing-complete），可以被看作是一种通用语言，因而很容易克服XPath的诸多局限，但代价是复杂性略有增加。

But XQuery is Turing-complete and can be considered a general-purpose language ; it easily overcomes many of the limitations of XPath , at the expense of introducing a little complexity .

第四章对带有初边界值条件的线性薛定谔方程，通过作关于t的Laplace变换得到等价的积分方程，证明了方程的解算子是图灵可计算的。

Chapter 4 studies the linear Schrodinger equations with initial boundary value conditions , we get its equivalent integral equation by taking the Laplace transform with respect to the variable t , then we prove that its solution is Turing computable .

他还为图灵的项目取了一个比死气沉沉的“ENIAC”和“EDVAC”更好听的名字，

Womersley also coined a more happy acronym for the Turing electronic computer project than the soulless ENIAC and EDVAC .

1946年11月22日，威廉姆斯与另外两位电子通信研究所的高层人员，R·A·史密斯和A·阿特里，来到国家物理实验室，跟沃默斯利和图灵一起商讨，该以什么样的方式合作，以帮助推动ACE项目。

On 22 November 1946 , Williams , together with two other top TRE men R. A. Smith and A. Uttley , made a visit to the NPL ' to discuss with Mr Womersley and Dr Turing in what way help could be given to the ACE project . '

安全多方计算问题首先由图灵奖得主Yao提出，随着学者的深入研究，目前已经细化产生了许多研究方向，比如秘密分享，计算几何，网上谈判，电子投票等。

This problem that was first proposed by Yao is creative problem in the SMC . Later scholars have done this in-depth research . SMC has generated a lot of research directions , such as secret sharing , computational geometry , on-line negotiations , electronic voting and so on .

JRW给图灵看了第一份关于EDVAC的报告，并建议他加入国家物理实验室，安排了面试，并说服了主席和秘书。

JRW shows Turing the first report on the EDVAC and persuades him to join NPL staff , arranges interview and convinces Director and Secretary .

他邀请了ENIAC团队的成员H·D·哈斯基，作为休假在国家物理实验室度过1947年。当图灵回国时，哈斯基已经安顿好了。

He had invited H.D. Huskey , one of the ENIAC team , to spend 1947 as a sabbatical year at the NPL , and he was already installed when Alan arrived back in a shivering Britain to give the last of the talks at the Ministry of Supply .

自图灵奖得主A.C.Yao于上世纪80年代初提出安全多方计算的概念以来，该领域已经成为现代密码学的重要研究内容之一，引起了众多研究者的兴趣。

Since it was initially suggested by A.C.Yao in the 1980s , SMC have been a major part of modern cryptography and attracted numerous researchers ' interest .

超级大师图灵曾梦见自己是一台机器，醒后他这样回忆。

Grand Master Turing once dreamed that he was a machine .

一类三阶微分算子自伴域的解析描述几个偏微分方程解算子的图灵可计算性

Analytic Descriptions of a Class Three-order Differential Operators ' Self-adjoint Domains

这几乎是图灵偶然得到的想法。

It was an idea that had arrived somewhat by chance .

在图灵模型中一个关键因素是扩散。

A key factor in Turing 's model was diffusion .