可计算性的英文

• calculability
• computability

• "可"英文翻译    approve
• "计算"英文翻译    count; compute; calculate; r ...
• "性"英文翻译    nature; character; dispositi ...
• "不可计算性" 英文翻译 :    uncomputability
• "部分可计算性" 英文翻译 :    partial computability
• "可计算性刻划" 英文翻译 :    characterization of computability
• "可计算性理论" 英文翻译 :    computability theory; recursion theory
• "可计算性逻辑" 英文翻译 :    computability logic
• "可行可计算性" 英文翻译 :    feasible computability
• "实用可计算性" 英文翻译 :    practical computability
• "算盘可计算性" 英文翻译 :    abacus computability
• "图灵机可计算性" 英文翻译 :    turing computability
• "预测可计算性函数" 英文翻译 :    predictably computable function; predictablycomputablefunction
• "可计算性与计算复杂性" 英文翻译 :    computability and complexity of computing
• "可计算性的等价定义" 英文翻译 :    equivalent definitions of computability
• "可计数 可计算" 英文翻译 :    countenable
• "可计算" 英文翻译 :    calculability
• "超计算性" 英文翻译 :    hypercomputation
• "计算性能" 英文翻译 :    calculated performance
• "可行计算性" 英文翻译 :    feasible computability
• "半可计算的" 英文翻译 :    semicomputable
• "半可计算集" 英文翻译 :    semicomputable set
• "不可计算" 英文翻译 :    non-computable
• "不可计算的" 英文翻译 :    incalculable
• "可计算的" 英文翻译 :    calculable; computable; countable; reckonable

• Computable general equilibrium model of the structural changes of beijing
  北京市结构变化的可计算性一般均衡模型
• The primary area of his research interests is logic and its applications in computer science
  可计算性逻辑（这次课程的题目） - -是他近年提出来的。
• Crude petroleum and petroleum products - transfer accountability - assessment of on board quantity and quantity remaining on board
  原油和石油产品.运输的可计算性.装船数量和留在船上的油料数量的评定
• With the use of computability theory dividing whole - word coding into two parts : writing - input coding and computational coding , an method of none keyboard mapping for spelling language is proposed
  本文依据可计算性理论，提出了拼音文字非键盘映射编码方法，将整词编码分为输写码与计算码。
• The technique of sensitivity analysis presented is based on the foundation of analysis of variance which dose not need the information of derivative and has the advantage of calculating feasibility
  作者提出了基于方差分析的灵敏度分析方法，不需要导数信息，就能了解在优化过程中，各个设计变量对目标函数值的影响，具有可计算性的优点。
• The whole words computing codes can do both bearing information of complex whole word features and guaranteeing the computability of information , so that sets up an feasible and scientific best for unified computation and parallel processing of mongolian whole words
  整词计算码既可载荷整词复杂特征知识信息、又可保证信息的可计算性，从而为蒙古文整词复杂特征合一计算和并行处理奠定了可行性科学基础。
• The specification of a satisfactory general analysis of causal relations has long proved difficult . the research described in this thesis is an attempt to develop a computational theory of causal relations between temporally ordered events , and more precisely causal relations among partial states and actions , from the causal reasoning point of view
  本论文中所描述的研究工作是试图建立一个因果关系的可计算性理论，而且从因果推理的观点来看，这里的因果关系被限制在基于时间上有序事件之间，更精确地说是存在于部分状态与动作之间的。
• Now , the most word sense disambiguation algorithm on the parallel corpora is limited in the context of the single ambiguous word and its alignment information . in this paper , we made full use of computability of the concept in the hownet and changed word sense disambiguation problem into the similarity calculation problem between the ambiguous word and the whole sentence of the other language . in this way , we disambiguated the ambiguous word from a new point of view and achieved the satisfactory result
  当前大多数基于双语语料的词义排歧算法都局限在利用单个多义词的上下文环境及其对应信息，本文则充分利用当前hownet资源中概念的可计算性，将词义排歧的问题转化为多义词和另一种语言的相应句子的整体意义相似性问题，从一个新的角度来进行词义排歧，因此得出了满意的研究结果。
• Firstly , this paper deeply studied the simulated evolution theory , demonstrated the feasibility of resolving the optimization problems in the thermodynamic control systems with simulated evolution theory , and through the analysis of the calculability of this theory , created the general frame of the simulated evolution algorithm and created the theoretical base for building the evolution optimizing architecture of thermodynamic control systems
  首先，对模拟进化理论进行深入研究，说明了运用模拟进化理论解决热力控制系统优化问题的可行性，并通过对模拟进化理论的可计算性分析，建立了模拟进化算法通用框架，为建立热力控制系统进化优化体系建立了理论基础。
• The thesis consists of four sections . in section one , we introduce some background of the topic , in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees , in section three , we outline the basic principles of the priority tree argument , one of the main frameworks and tools of theorem proving in computability theory , and in section four , we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a , b such that a , b ? pc , and the join a v b of a and b is high
  本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题?加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a ， b ，满足a ， b pc ，而且a和b的并a b是一个高度。

• 可计算性的法语：computabilité
• 可计算性的日语：けいさんかのうせい コンピュータビリティ
• 可计算性的阿拉伯语：الحاسوبية;