全部 标题 作者 关键词 摘要
Keywords: Computability theory,computably enumerable set,computably enumerable degree,Turing reducibility,relative computability可计算性理论,可计算枚举度,可计算枚举度,Turing归约(图灵归约),相对可计算性.
Full-Text Cite this paper Add to My Lib
It is shown that there exists a diamond of high computably enumerable degrees preserving the greatest element 1.
Full-Text
Contact Us
service@oalib.com
QQ:3279437679
WhatsApp +8615387084133
