computability
英
美
n. 可计算性
双语例句
- Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model – the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。 - This includes computability theory, computational complexity theory, and information theory.
这包括可计算性理论，计算复杂性理论，信息理论。 - Experimental results show that scientifically controls the granularity of semantic depiction can enhance the computability of word senses, and improve the accuracy of word sense discrimination.
实验结果表明，科学控制词义刻画的粒度可以增强词义的可计算性，提高词义识别的精度。 - Knowledge Representation and Reasoning Based on Computability Logic
基于可计算性逻辑的知识表示与推理 - This fact makes them very suitable for theoretical investigations of computability questions.
这一事实使它们非常适合于理论研究的可计算性问题。 - The technical details of things like Turing completeness and theories of computability are beyond most of them.
如图灵可计算的完整性和理论的东西的技术细节超出了大多数。 - The following table shows some of the classes of problems that are considered in computability theory and complexity theory.
下面的表格指出了在可计算性和复杂性理论应当考虑的一些种类的问题。 - It is a formal theory of computability in the same sense as classical logic is a formal theory of truth.
它是可计算性的形式理论，正如经典逻辑是真理的形式理论。 - For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。 - They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.
尔后课程中将可利用这些方法来设计与分析算法、可计算理论、软件工程与计算机系统。 - Based on the sound and complete subset CL4 of computability logic, knowledge representation is discussed by dividing knowledge into elementary and general ones.
以可计算性逻辑的完备子集CL4为基础进行知识表示，将知识分为简单知识与一般知识。 - All these researches improve the computability of the language processing.
这些研究增强了语言处理的可计算性。 - Research on Basic Instructions of Computability Function
可计算函数的基本指令研究 - The traditional theory of computability is based on Turing machines.
传统的可计算性理论以图灵机为基础模型。 - Research on Interactive Computability and Its Topological Approaches
交互可计算性和拓扑方法的研究 - The parameterization model can transform the complex drawing procedure into an automatic design process of aircraft shape, so that the designability and computability for the shape design of aircraft are enhanced.
本文研究的参数化模型可以把原来飞机外形复杂的画图过程转化为飞机外形的自动化设计过程，从而提高飞机外形设计的可设计性和可计算性。 - The Research and Implementation of Computability on the Chinese Segmentation Specification
中文分词规范可计算化的研究与实现 - In one word, the task of interactive computability theory is to determine the computing capability of interactive systems and interaction mechanisms.
交互可计算性理论的问题归结为一点，就是研究交互式系统和交互机制的计算能力。 - In order to derive explicit results, this paper bases its view on the substantial mathematical concept of computability.
为了获得明确的结果，本文将视角建基于“可计算性”这一坚实的数学概念之上； - Based on the theory of recursive computability, the proposition of computer solvable on even Goldbach conjecture is proposed.
根据递归可计算性理论，提出偶数Goldbach猜想计算机可解命题。 - For validating validity and computability of the algorithm, the influencing factor of algorithm is discussed with the theoretic error analysis of the algorithm and its example.
此外，结合算法误差的理论分析和算例探讨了影响算法误差的各种因素，进一步论证了算法的正确性和有效性。 - The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA分子的可计算性及其计算能力。 - In this paper the expanded state model for multi-input multi-output ( MIMO) closed-loop digital control systems is developed, and the relation between the computability, solvability of the model and its coefficient matrixes is also considered.
本文推导出了多输入多输出（MIMO）闭环数字控制系统的扩展状态模型，并讨论了此模型的可计算性、可解性与系数矩阵之间的关系； - Automata theory is the basic of research of algorithm description and analysis, the theory of computation complexity, and computability, etc.
自动机理论是算法描述和分析，计算复杂性理论，可计算性等研究的基础，它为计算理论提供了可靠的数学模型。 - The computability theory is one of the vital and hard problems in computer scientific research nowadays.
可计算性理论是当今计算机科学中研究的热点和难点问题之一。 - Computability, rationality and practicality of this approach are explained through practical case studies.
通过应用案例，论证了这一方法的可运算性、合理性和实用性。 - Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA ( elliptic curve digital signature algorithm) from the computability and security view.
利用一个改进的椭圆曲线签名方程，我们得到一个从计算和安全上都比现有的椭圆曲线数字签名算法（ECDSA）更高效的签名方案。 - It is the study of computability and complexity of continuous problems based on Turing machines.
可计算分析是以图灵机为基础研究连续性问题的可计算性和可计算复杂性。 - From the perspective of computability theory, static analysis is a computationally undecidable problem.
从可计算性理论的角度来看，静态缺陷检测是一个不可判定问题。 - The concept of truth in classical logic is similar to validity in computability logic.
经典逻辑的真的概念就相当于CL2中的可计算性的概念。