您要查找的是不是：
- Turing machine formalization 图灵机形式化
- They gave the formal definition of Turing reduction in terms of oracle Turing machine (OTM). 他们用oracle图灵机(OTM)模型给出了图灵归约的形式定义。
- This paper discusses how to simulate Turing machine by Petri net from the viewpointof information transformation. 本文从信息变换的角度来阐明“如何用Petri网模拟Turing机”。
- The similiarities and differences between DNA computer and turing machine are compared also. 比较了DNA计算机与图灵机的异同;
- It is declared in the A. Church proposition that every algorithm can be described with a Turing machine. 著名的丘奇(A.;Church)命题指出;任何算法都可以用一个图灵机来描述
- Finally, the operation's expression ability of Turing machine properties is proved. 最后证明了这类操作的图灵机表达能力。
- Lisp: Turing Machines are an awkward way to describe computation. 图灵机的计算模式糟得很。
- A model proposed by Davis for computable functions is equivalent to Turing machine and consists of three basic Fortran-form instructions. Davis曾提出由三条Fortran语言形的基本指令组成的与Turing机等价的计算模型。
- Those relations among the reduciblities are discussed,We introduce the Operator Turing Machine and give a Turing hierarchy of C[0,1] by using it. 引入了算子图灵机的概念,利用算子图灵机给出了 C[1,0]上的一个分层(不可解度的分层)。
- The production line include ZC auto washer, GD balanced pressure filer, WFG cap turing machine, SSJ carrying machine etc. 本生产流水线有ZC型自动冲瓶机、GD型等压灌装机、WFG型旋盖机及SSJ型输送机等系列产品组成。
- One model, the Turing machine, stores characters on an infinitely long tape, with one square at any given time being scanned by a read/write head. 一种模式是图灵机，它把字符储存在一个无限长的纸带上，每次扫描一个方格时，都要读写带头。
- An alternating Turing machine M is a generalization of a nondeterministic Turing machine, whose state set is partitioned into'universal'and'existential'states. 交替式(alternating)图灵机是非确定性图灵机的推广,它的状态集合被分为万能状态(universal state)和存在状态(existential state)。
- Through some examples, the paper shows that the Turing machine which scans multiple characters is equivalent to a Turing machine scanning one character. 该方法简便且有效，通过实例证明了扫描多个符号的图灵机与扫描一个符号的图灵机是等价的。
- Interestingly, we discovered later that this last element was similar to a design that Paul Rothemund, a former student of Adleman, once proposed for a molecular Turing machine. 有趣的是，我们后来发现后者和罗瑟蒙（PaulRothemund）的设计类似，而罗瑟蒙的老师正是提出分子涂林机器观念的艾德曼。
- He was already an accomplished computer scientist and software pioneer with a growing interest in biology in 1998 when he first designed a model for a molecular Turing machine. 夏比洛是杰出的资讯工程科学家和软体设计先驱，对生物领域越来越感兴趣，并于1998年设计了第一个分子涂林机器的模型；
- And yet from a computational standpoint, our automaton still seemed like a self-propelled scooter compared with the Rolls-Royce of computers on which we had set our sights: the biomolecular Turing machine. 然而从计算的观点来看，我们的自动机就像人力推进的滑板车一样，而我们的目标，是建造劳斯莱斯级的生物分子涂林机器。
- Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. 目前对属性文法循环性问题复杂度的证明，多基于自动机理论，如写入推出接受器、交替涂林机等。
- 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机)和量子文法(如量子上下文无关文法和上下文有关文法)奠定了基础.
- The machine must break down at this busy hour. 正忙的时候，机器偏偏又坏了。
