助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   图灵机 的翻译结果: 查询用时:1.168秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
数学
自动化技术
互联网技术
更多类别查询

图标索引 历史查询
 

图灵机
相关语句
  turing machine
     Computing Klein—Gordon Equation on Turing machine
     用图灵机计算Klein—Gordon方程
短句来源
     They gave the formal definition of Turing reduction in terms of oracle Turing machine (OTM).
     他们用oracle图灵机(OTM)模型给出了图灵归约的形式定义。
短句来源
     Proof of the Virus Decidability Theorem Based on a Universal Turing Machine Model
     基于通用图灵机模型的病毒判定性定理证明
     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)。
短句来源
     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中的高层次综合和逻辑综合环节中。
短句来源
更多       
  turing machines
     Defining Nondeterminism in the Space Bounded Turing Machines
     关于空间有界图灵机的细分非确定性
短句来源
     The traditional theory of computability is based on 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)不可解基础之上。
短句来源
     But the language constructed there is indeed an unnatural one because the construction needs to run all polynomial time Turing machines.
     但 Lander给出语言并不是一个自然的语言因在该语言的构造中需运行所有多项式时间的图灵机 .
短句来源
     In the field of complexity theory, most of complexity classes are described according to their acceptance by different kinds of Turing machines.
     在计算复杂性领域里,大多数复杂类都是按照接受它们的图灵机而加以描述的。
短句来源
更多       
  turing
     Computing Klein—Gordon Equation on Turing machine
     用图灵机计算Klein—Gordon方程
短句来源
     They gave the formal definition of Turing reduction in terms of oracle Turing machine (OTM).
     他们用oracle图灵机(OTM)模型给出了图灵归约的形式定义。
短句来源
     Proof of the Virus Decidability Theorem Based on a Universal Turing Machine Model
     基于通用图灵机模型的病毒判定性定理证明
     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)。
短句来源
     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中的高层次综合和逻辑综合环节中。
短句来源
更多       
  “图灵机”译为未确定词的双语例句
     The Design and Implementation of TuringMachine Simulation System
     图灵机模拟系统的设计与实现
短句来源
     In this pa- per,we mainly introduce the grammar structures and the computation methods of DNA splicing model,discuss the computational capacity of several DNA splicing models,and prove the functions which can be calculated by Turning machine will also be work out by DNA splicing model in theory.
     本文主要介绍 DNA 剪接计算模型的文法结构和剪接计算方法,探讨了不同 DNA 剪接计算模型的计算能力,证明了所有图灵机可计算的函数理论上都可以通过 DNA 剪接计算模型来计算。
短句来源
     this is true for most automata and language theory models.
     可以证明,利用这些操作可以建立计算模型,并且在功能上等价于图灵机
短句来源
     Secondly, we discuss the complexity any algorithm solving RHC presents by counting the moving times of the tape head on turning machine.
     在此基础上,通过分析通用图灵机带头移动的次数,讨论了通用图灵机上任一求解RHC的算法的复杂性。
短句来源
     Guidelines for developing global optimization m ethods for NP hard problems are proposed: 1 A conjecture that if a method can solve NP hard problem s efficiently,it m ust be based on random ization techniques is proposed.
     通过对现有的 NP难问题求解方法的分析 ,结合非确定性图灵机理论 ,提出基于随机化技术的方法是求解 NP难及 NP完全问题惟一有效途径的猜想。
短句来源
更多       
查询“图灵机”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  turing machine
One method of proving that some Turing machine is not universal is to prove that the halting problem is solvable for it.
      
The problem of finding a Turing machine with undecidable halting problem whose program contains the smallest number of instructions is well known.
      
Such a robot is an analogue of the Turing machine, where the tape is replaced by a graph and the cells are assigned to the graph vertices and arcs.
      
Such a robot is an analogue of the Turing machine, where the tape is replaced by a graph and the cells are assigned to the graph vertices and arcs.
      
Simulation of circuits of functional elements by the universal Turing machine
      
更多          
  turing machines
Solvability of the halting problem for certain classes of Turing machines
      
Turing Machines Connected to the Undecidability of the Halting Problem
      
In this paper, Turing machines with undecidable halting problem satisfying this condition are called connected.
      
We investigate the relationship between the classes of ω-languages accepted by Turing machines according to two types of acceptance: 1) Machines of the first type are allowed to read only a finite part of the infinite input.
      
Consistency proof without transfinite induction for a formal system for turing machines
      
更多          
  turing
Chaotic turing pattern formation in spatiotemporal systems
      
The problem of Turing pattern formation has attracted much attention in nonlinear science as well as physics, chemistry and biology.
      
So far spatially ordered Turing patterns have been observed in stationary and oscillatory media only.
      
In this paper we find that spatially ordered Turing patterns exist in chaotic extended systems.
      
And chaotic Turing patterns are strikingly rich and surprisingly beautiful with their space structures.
      
更多          


Let H be a language over alphabet Ω and L a language over alphabet Σ, each symbol in Ω being a homomorphism or an anti-homomorphism on L. The set H(L) = {X(w)\Xε.H, WεL} is said to be a bi-language form. In this paper it is shown that the class of language accepted in real time by nondeterministic reversal-bounded multitape Turing machines, NP and the class of the recursively enumerable sets are closed under bi-language form operations when the homomorphisms are linear-erasing, polynomial-erasing and arbitrary...

Let H be a language over alphabet Ω and L a language over alphabet Σ, each symbol in Ω being a homomorphism or an anti-homomorphism on L. The set H(L) = {X(w)\Xε.H, WεL} is said to be a bi-language form. In this paper it is shown that the class of language accepted in real time by nondeterministic reversal-bounded multitape Turing machines, NP and the class of the recursively enumerable sets are closed under bi-language form operations when the homomorphisms are linear-erasing, polynomial-erasing and arbitrary respectively.

如H,L属于某语言类,而H的每个字符都是L上的一个同态或反同志,则可定义H(L)={x(w)|x∈H,w∈L}为双语言形式。由读与头换向次数有界的非确定多带图灵机,在实时运行下所能接受的语言类称为BNP。本文讨论了在上述定义中的同态或反同志为线性消除、多项式消除及任意同态的情况下,双语言形式分别在BNP语言类、NP语言类及递归可枚举语言美中的封闭特性。

M. R. Garey and D. 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]. They gave the formal definition of Turing reduction in terms of oracle Turing machine (OTM). But there is a mistake in this formal definition given in [3]. We point out this mistake and correct it in this paper.

M.R.Garey和D.S.Johnson在[3]中引入“图灵归约”的概念,利用这个概念把NP完全性理论推广到包括组合最优化问题在内的更广的一类问题上。他们用oracle图灵机(OTM)模型给出了图灵归约的形式定义。但是,[3]中给出的这个形式定义是错误的。本文指出了这个错误并给出修正。

The nondeterministical complexity of a Turing machine T is definedto be the number of the nondeterministical moves made by T.It is,ingeneral,a function of the length of input.In this paper,we discuss thehierarchy problems with respect to the nondeterministical complexity andtheir relativization problems.In particular,we prove that there exists anOracle set E so that,in respect of E,there is an infinite hierarchy basedon the nondeterministical complexity.

一个非确定图灵机的非确定度被定义为它所做的非确定选择的次数,一般地说,这个次数是输入长度的函数.本文把非确定度看作一种资源.讨论了关于非确定度的分层问题及其相对化形式.特别地,本文证明了,存在 Oracle 集 E,使得关于 E,一个基于非确定度的无穷分层是存在的.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关图灵机的内容
在知识搜索中查有关图灵机的内容
在数字搜索中查有关图灵机的内容
在概念知识元中查有关图灵机的内容
在学术趋势中查有关图灵机的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社