computability

computability

美 [kəm'pjʊtəbɪlɪtɪ] 　英 [kəm'pjʊtəbɪlɪtɪ]

• n.〔数〕可计算性
• 网络可算性；来自可计算性；可计算性论

英汉解释

n.	1. 〔数〕可计算性

例句

The classical concept of truth turns out to be a special, zero-interactivity-degree case of computability .

真理的经典概念转变为可计算性的特殊的零交互度的情况。

He did make a brief contribution to the book, buried in chapter 26, in which he summarized computability and the universal machine.

图灵的确为书做处简要的贡献，这在第二十六章可以看出，他总结了可计算性和通用机械。

For a more advanced graduate course, computability theory and computational complexity theory are also covered.

高级课程中还包括了可计算理论和计算复杂性理论。

Thanks to its computability, it has been applied in quantifying local coherence of discourse segments.

该模式因其具有可计算性特征而被逐渐应用于语篇局部连贯性的量化分析。

with the programming language Scheme used to crystallize computability constructions and as an object of study itself.

关于电脑程序语言计划习惯于用明确性的运算结构，就如一个自学的对象？？。

For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.

高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。

In general, questions of what can be computed by various machines are investigated in computability theory.

一般而言，计算性理论研究的问题是：什么是能够被各种机器计算的问题。

Hence meaningful concepts of "intuitionistic truth" and "linear-logic truth" can be derived from the semantics of computability logic.

因为“直觉真理”和“线性逻辑真理”的有意义的概念可从可计算性逻辑的语义中推导出来。

In computability theory, there is a closely related concept known as Turing equivalence.

翻译过来就是：在可策画理论里，有一个很相干的概念叫图灵等价。

The proofs of computability give rise to Turing algorithms, which may possibly be translated into numerical algorithms.

可计算性的证明过程通常会产生图灵算法，这些图灵算法可能会被转化为数值算法。

establishing theories of computability, methods of computation, and methods of efficient data.

（高效数据存储和访问的方法）。

This makes classical logic a special fragment of computability logic.

这使经典逻辑成为可计算性逻辑的特殊片段。

It is the goal of computability theory of automata to answer just this question.

它的目标是可计算性理论，自动回答刚才这个问题。

Being semantically constructed, as yet computability logic does not have a fully developed proof theory.

正在做着语义构造，至今可计算性逻辑仍没有完全开发出证明论。

Computability Theory of and with Scheme

可计算性理论计划

Bibliographic Database for Computability Theory

可计算行理论数据库

Computability and Complexity of Computing

可计算性与计算复杂性

Computability and Complexity in Analysis

分析中的可计算性与复杂性

Theory of Computability and Some Key Question in Theory of Linguistics

可计算性和语言学理论的几个关键问题

On the computability of real numbers

关于实数的可计算性