turing的例句大全

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

报告了关于少儿图灵测试 ( CTT ) 的一项研究工作.

The paper discusses the relations among the Turing, the Von Neumann model and computer languages.

本文简单讨论了图灵模型机 、 冯·诺依曼机和计算机语言之间的关系.

She was made to pass the Turing test.

她是通过图灵测试.

Turing the wheel can straight or back without electric power.

不用动力,用手转动方向盘可前进后退.

Turing test, physical symbolic hypothesis and soon play important roles to push research on intelligence.

图灵测试 、 物理符号假设等对智能研究的发展起了积极的推动作用.

The Turing test obviously has its limitations.

显然,图灵测试也有其局限性.

She cannot dump people because she was not made to even try to a Turing test.

她不能转储人,因为她不作出甚至尝试通过图灵测试.

These days , instead of turing turning paper pages , many readers reach for hang handheld devices.

进来, 许多读者不再翻阅纸书,而是使用手持设备来阅读.

In the beginning Turing created the Machine.

初,图灵创造了机器.

Later, this model is called as the Turing machine.

后来, 人们就称这个数字模型为图灵机.

The main content of this dissertation is to research and develop automatic bearing turing product line.

研究和开发自动轴承车削生产线是本文的主要目的.

This paper discusses how to simulate Turing machine by Petri net from the viewpointof information transformation.

本文从信息变换的角度来阐明“如何用Petri网模拟Turing机”.

As of a few months ago, these spam filters no longer pass my little Turing test.

但从几个月前开始, 这些邮件过滤器再也不能通过我小小的图灵测试了.

Emulates a Turing Machine complete source code can be used directly.

模拟图灵机完整的源代码可以直接使用.

The process require high turing process and control of reldin g deformations.

对制作工艺及焊接变形控制要求较高.

The finite state automaton is a type of programmable and autonomous computing device which possess partial Turing machine computing power.

有限状态自动机是一种实现了部分图灵机功能的可编程自发计算装置。

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

他们用oracle图灵机 ( OTM ) 模型给出了图灵归约的形式定义.

There are many states and complex function _ δ _ on conventional solving methods of Turing Machine.

图灵机设计问题的常规解法一般有多个状态和较复杂的δ映像函数.

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.

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

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

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