computably

与computably相关的网络例句 [注：此内容来源于网络，仅供参考]

Consequently, the class PC of the plus cupping computably enumerable degrees is not an ideal of ?, the upper semilattice of the computably enumerable degrees.

因此所有加杯可计算枚举度组成的集合PC不是ε的理想，这里ε是所有可计算枚举度构成的上半格。

In section one, we introduce some background of the topic, in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic- the algebraic structure of the plus cupping Turing degrees, in section three, we outline the basic principles of the priority tree argument, one of the main frameworks and tools of theorem proving in computability theory, and in section four, we prove a new result concerning the algebraic structure of the plus cupping Turing degrees that there exist two computably enumerable degrees a, b such that a, b ? PC, and the join a V b of a and b is high.

度结合为0′。本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题—加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a，b，满足a，b∈PC，而且a和b的并a∨b是一个高度。

Computably enumerable degree; minimal pair.

可计算枚举图灵度；极小对。