The traditional theory of computability is based on Turing machines.
传统的可计算性理论以图灵机为基础模型。
It is a formal theory of computability in the same sense as classical logic is a formal theory of truth.
它是可计算性的形式理论，正如经典逻辑是真理的形式理论。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
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).
下面的表格指出了在可计算性(蓝色)和复杂性理论(绿色)应当考虑的一些种类的问题。
In general, questions of what can be computed by various machines are investigated in computability theory.
一般而言，计算性理论研究的问题是：什么是能够被各种机器计算的问题。
The following table shows some of the classes of problems that are considered in computability theory and complexity theory.
下面的表格指出了在可计算性和复杂性理论应当考虑的一些种类的问题。
The series papers systematically discuss the computability and the computational capacity of DNA molecular using the formal language and automata theory.
本系列文章应用形式语言及自动机理论技术，系统地探讨了DNA分子的可计算性及其计算能力。
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 three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.
有三个核心领域：形式语言与自动机理论、可计算性理论和计算的复杂性理论。
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.
研究了无穷计算的基本性质，引入基于相对可计算理论的过程模式可计算泛函概念。
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.
研究了无穷计算的基本性质，引入基于相对可计算理论的过程模式可计算泛函概念。
应用推荐