该词条未找到_海词词典

您要查找的是不是：

Imitating turing machining 仿车削加工
Lisp: Turing Machines are an awkward way to describe computation. 图灵机的计算模式糟得很。
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. 最后证明了这类操作的图灵机表达能力。
Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing machines. 目前对属性文法循环性问题复杂度的证明，多基于自动机理论，如写入推出接受器、交替涂林机等。
It uses classical key to encrypt quantum message, and its security relies on the fact that NPC problem can not be solved on quantum Turing machines. 其特点是以经典信息作为密钥来加密量子消息,安全性建立在NPC问题量子图灵机(QTM)不可解基础之上。
A model proposed by Davis for computable functions is equivalent to Turing machine and consists of three basic Fortran-form instructions. Davis曾提出由三条Fortran语言形的基本指令组成的与Turing机等价的计算模型。
Bacteria-phage computer takes insertion/deletion systems as its theoretical model, this model has the same computing capability as Turing machines. 菌毒计算机采用insertion/deletion systems(插入删除系统)为其理论模型，该系统具有和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型输送机等系列产品组成。
But the language constructed there is indeed an unnatural one because the construction needs to run all polynomial time Turing machines. 但 Lander给出语言并不是一个自然的语言因在该语言的构造中需运行所有多项式时间的图灵机 .
In this course we concentrate on languages (e.g. sets of words) described by finite automata, context-free grammars and Turing machines. 在这本书中我们集中讲述由有限自动机、上下文无关文法和图灵机所描述的“语言”（单词的集合）。
He's very clever at imitating his friends. 他非常擅长於模仿朋友的言行。
Some of these models are the recursive functions of Godel, of Church, Post machines of Post and the Turing machines of Turing. 其中一些模型是哥德尔的递归函数，丘奇的演算，波斯特的波斯特机和图灵的图灵机。
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)。