The traditional theory of computability is based on Turing machines.
传统的可计算性理论以图灵机为基础模型。
All these researches improve the computability of the language processing.
这些研究增强了语言处理的可计算性。
In computability theory, there is a closely related concept known as Turing equivalence.
在可计算理论里，有一个很相关的概念叫图灵等价。
This includes computability theory, computational complexity theory, and information theory.
这包括可计算性理论，计算复杂性理论，信息理论。
This fact makes them very suitable for theoretical investigations of computability questions.
这一事实使它们非常适合于理论研究的可计算性问题。
It is a formal theory of computability in the same sense as classical logic is a formal theory of truth.
它是可计算性的形式理论，正如经典逻辑是真理的形式理论。
In general, questions of what can be computed by various machines are investigated in computability theory.
一般而言，计算性理论研究的问题是：什么是能够被各种机器计算的问题。
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.
下面的表格指出了在可计算性和复杂性理论应当考虑的一些种类的问题。
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。
The three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.
有三个核心领域：形式语言与自动机理论、可计算性理论和计算的复杂性理论。
The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA分子的可计算性及其计算能力。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
Based on the sound and complete subset CL4 of computability logic, knowledge representation is discussed by dividing knowledge into elementary and general ones.
以可计算性逻辑的完备子集cl4为基础进行知识表示，将知识分为简单知识与一般知识。
The model has clear mathematical and physical meaning and excellent computability. The efficiency of the method has been demostrated by both simulation and practice.
本方法数学、物理意义明确，可计算性强，无论电算、手算均具有很多优越性。
The following table shows some of the classes of problems (or languages, or grammars) that are considered in computability theory (blue) and complexity theory (green).
下面的表格指出了在可计算性(蓝色)和复杂性理论(绿色)应当考虑的一些种类的问题。
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.
尔后课程中将可利用这些方法来设计与分析演算法、可计算理论、软体工程与电脑系统。
The basic properties of the infinite computation are studied. The concept of the procedure schemata computable functional based on the relative computability theory is introduced.
研究了无穷计算的基本性质，引入基于相对可计算理论的过程模式可计算泛函概念。
So their computability complexity is low and speed is quick. Experiment is important for the study of path planning to validate the performances of algorithms and to make comparisons.
在路径规划算法的研究中实验具有重要的作用一般用来验证算法在实际环境下的各种性能并可用于对不同算法进行性能比较。
The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs", and "self-copying programs".
在可计算理论和计算机科学领域的标准定义，叫做“自我重复程序”、“自我生成程序”和“自我拷贝程序”。
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.
实验结果表明，科学控制词义刻画的粒度可以增强词义的可计算性，提高词义识别的精度。
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.
本文依据可计算性理论，提出了拼音文字非键盘映射编码方法，将整词编码分为输写码与计算码。
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.
本文依据可计算性理论，提出了拼音文字非键盘映射编码方法，将整词编码分为输写码与计算码。
应用推荐