Much work has been done in this completely new area and remarkable results have been achieved such as quantum Turing machine quantum teleportation and quantum cryptography .

人们已经在这一全新的领域做了大量的研究工作，取得了令人瞩目的成果，如量子 图 灵机、量子隐形传态及量子密码术等。

Systemic security strategy is described by security query in administrative model of role-based access control ( RBAC ) . According to the definition of state-transition system security analysis is defined and executed on Turing machine .

在基于角色的访问控制管理模型中，采用安全查询来描述系统安全策略，引入状态变换系统定义基于角色的访问控制管理模型及其安全分析， 用 图 灵机理论和计算复杂性理论进行安全分析。

The turing machine simulates the security system and describe the states transition of the security system and supplies a theory basis for designing architecture of the security system .

该 自动机模拟了安全系统，为安全系统的行为描述和结构设计提供理论依据和论证。

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

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

That is they are capable of computation in the same manner as a universal Turing machine .

也就是说，他们是在计算能力作为一个通用 图 灵机的方式相同。

Turing machine takes the intuition conception of feasible computability into strict formality and the Church-Turing Thesis that any feasible computability function is universal Turing machine computability is come into being .

图 灵机把关于能行可计算的直观看法变成了严格的形式定义，于是形成了任何能行可计算的函数都是通用图灵机可计算的这一丘奇-图灵论题。

Oracle Turing machine cartographic mode My model aircraft transmitter failed and the plane went haywire and crashed into tree .

我的飞机模型的 发射机 失灵了，飞机失控了，撞到了一棵树上。

This article illustrates the origin of machine functionalism and the concept of Turing machine and machine table simply then compares machine functionalism with behaviorism and identity and discusses the understanding of machine functionalism about mind-body problem and its positive sense .

本文对机器功能主义的产生、 图 灵机和机器表概念做了一个简要说明，同时把机器功能主义与行为主义、同一论相比较，论述了机器功能主义对心身问题的理解及其积极意义。

According to Putnam the theory of Turing machine acts as a proper analogy for us to understand the mind of human beings .

普特南认为： 图 灵机的理论 模型给我们理解人类的心灵提供了一个很好的比拟物。

It is declared in the A. Church proposition that every algorithm can be described with a Turing machine .

著名的丘奇（A.Church）命题指出，任何算法都可以用一个 图 灵机来描述。

Just think of the inventors of the laser the Turing machine or the discoverers of DNA .

想想激光、 图 灵机的发明人，或者dna的发现者吧。

Research of Petri net model of basic Turing Machine

基本 图 灵机的Petri网建模研究

Just haven 't seen an inductive Turing machine used like that before .

还没见过像那样用归纳 图 灵机的。

The computer power of DNA computation and P system has been proven to be equivalent with Turing machine . But the parallel computing mechanism which is adopted by DNA computing and P system is far superior to the serial computing system which is the basis of the traditional computer .

DNA计算以及P系统的计算能力都被证明是与 图 灵机等价的，但是DNA计算与P系统采用的并行计算模型远远优于基于现代计算机的串行计算机制。

By inheriting from works done by others we introduce Turing machine model which is of most importance to the computational complexity theory high level synthesis and logic synthesis .

本文在继承前人工作的基础上，将最基本也是最重要的 图 灵机模型及其依据于此的计算复杂性理论的若干重要概念与思想引入到 EDA中的高层次综合和逻辑综合环节中。

Summarily the introduced work lays a foundation for further studies on more complicated quantum automata and quantum grammars such as quantum pushdown automata and Turing machine as well as quantum context-free grammars and context-sensitive grammars .

因此，为进一步研究更复杂的量子自动机（如量子下推自动机和 Turing 机）和量子文法（如量子上下文无关文法和上下文有关文法）奠定了基础。

It is proved that the SEE ' satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine .

通过给出具体的确定型 图林 机，证明了SBE的可满足性（SAT）问题在多项式时间内可解。

Turing Machine and Its Construction Researching

图 灵机及其构造研究

In1982 Richard Feynman suggested that the venerable Turing machine might not be as powerful as people thought .

年RichardFeynman提出，值得尊敬的 Turing 机器的功能也许并没有人们所想的那么强大。

Through simulating Turing machine it is proved that these systems are Turing universal in synchronous working mode .

通过模拟 注册 机，证明了在同步模式下，该系统可实现计算通用性。

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

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

In the theoretical route Turing constructed an abstract math model namely Turing Machine to settle determinant questions .

在理论路线上，为了解决判定问题，图灵构建了一个抽象的数学模型，即 图 灵机。

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 .

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

Through some examples the paper shows that the Turing machine which scans multiple characters is equivalent to a Turing machine scanning one character .

该方法 简便且有效，通过实例证明了扫描多个符号的图 灵机与扫描一个符号的图灵机是等价的。

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

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

As a matter of fact human mind is a Turing machine . So each human mental state is equal to a computational state and each mental procedure is equal to a computational procedure with the mental representation as its object of computation .

人的心灵其实就是 图 灵机，人的每一个心理状态等同于一个计算状态，心理过程等同于计算过程，并且以心理表征作为计算操作的对象。

Later this model is called as the Turing machine .

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

An Analysis of the Difference in Computing Efficiency between Off-Line Turing Machine and Single-Tape Turing Machine

离线 图 灵机与单带图灵机的计算效率分析

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

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