ISCAS OpenIR  > 基础软件与系统重点实验室
计算可枚举度中的嵌入研究
Alternative TitleA Study of Embeddings in the Computably Enumerable Degrees
赵纪太
Major计算机软件与理论
Supervisor李昂升
2008-06-02
Degree Grantor中国科学院研究生院
Degree Level硕士
Place of Degree Grantor中国科学院软件研究所
Keyword计算可枚举度 高度/低度 嵌入
Classification暂无
English Abstract在这篇文章中,我们研究了计算可枚举图灵度中的嵌入扩充的一个问题,证明了对任意的计算可枚举度${\bf x\not\leq y}$,若或者${\bf y}$是低度,或者${\bf x}$是高度,那么存在一个计算可枚举度${\bf a}$使得${\bf 0
Call Number暂无
AbstractIn this paper, we study a problem with the extensions of embeddings in the computably enumerable Turing degrees. We show that for any c.e. degrees ${\bf x\not\leq y}$, if either ${\bf y}$ is low or ${\bf x}$ is high, then there is a c.e. degree ${\bf a}$ such that both ${\bf 0
Department计算机科学国家重点实验室
Content Type学位论文
URIhttp://ir.iscas.ac.cn/handle/311060/7530
Collection基础软件与系统重点实验室
Recommended Citation
GB/T 7714
赵纪太. 计算可枚举度中的嵌入研究[D]. 中国科学院软件研究所. 中国科学院研究生院,2008.
Files in This Item:
File Name/Size DocType Version Access License
10001_20052801502905(395KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[赵纪太]'s Articles
Baidu academic
Similar articles in Baidu academic
[赵纪太]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[赵纪太]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.