computably中文是什么意思

发音:

中文翻译
造句

computably
adv.
computable的变形
computable
[k?m'pju:t?bl]
adj.
可计算的

computalker [计] 可谈话的计算机
computable ring 可计算环
computant [网络] 计算机
computable inductor 可计算电感线圈
computate [网络] 计算
computable inductance 可计算电感
computation (arithmetic operation) [物理] 计算(算术运算)
computable general equilibrium (cge)model 可计算一般均衡模型
computation algorithm 《英汉医学词典》computation algorithm ; 计算机算法
computable functions [网络] 可计算功能

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

A computably enumerable ( c . e .,
一个可计算枚举(computablyenumerable，简记为c
A computably enumerable ( c . e . )
一个可计算枚举(c
Abstract : it is shown that there exists a diamond of high computably enumerable degrees preserving the greatest element 1
文摘:证明存在一个保持最大元1的可计算枚举高度的钻石格
Consequently, the class pc of the p lus cupping computably enumerable degrees is not an ideal of ? the upper semilattice of the computably enumerable degrees
因此所有加杯可计算枚举度组成的集合pc不是的理想，这里是所有可计算枚举度构成的上半格。
Consequently, the class pc of the p lus cupping computably enumerable degrees is not an ideal of ? the upper semilattice of the computably enumerable degrees
因此所有加杯可计算枚举度组成的集合pc不是的理想，这里是所有可计算枚举度构成的上半格。
The thesis consists of four sections . 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
本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题?加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a，b，满足a，bpc，而且a和b的并ab是一个高度。
The thesis consists of four sections . 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
本篇论文分为4个部分：第一部分介绍了这个领域的一些背景知识；第二部分主要回顾了前人在研究可计算枚举度的结构和层谱时所取得的一些基本和最新结果，这些结果与我们的主题?加杯图灵度的代数结构密切相关；在第三部分中，我们概要的描述了优先树方法的基本原理，此方法是可计算性理论中定理证明的一个重要框架和工具；第四部分证明了一个加杯图灵度代数结构的新结果：存在两个可计算枚举度a，b，满足a，bpc，而且a和b的并ab是一个高度。