传统的可计算性理论以图灵机为基础模型。
The traditional theory of computability is based on Turing machines.
这包括可计算性理论，计算复杂性理论，信息理论。
This includes computability theory, computational complexity theory, and information theory.
有三个核心领域：形式语言与自动机理论、可计算性理论和计算的复杂性理论。
The three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.
可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。
Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.
本文依据可计算性理论，提出了拼音文字非键盘映射编码方法，将整词编码分为输写码与计算码。
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 following table shows some of the classes of problems that are considered in computability theory and complexity theory.
下面的表格指出了在可计算性(蓝色)和复杂性理论(绿色)应当考虑的一些种类的问题。
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).
高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
应用推荐