| 摘要: |
| 证明了给定任何非零的递归可枚举图灵度 a存在递归可枚举图灵度 c
|
| 关键词: 图灵度 递归可枚举度 极小对 |
| DOI： |
| 分类号: |
| 基金项目:Project is supported by the National Natural Science Foundation of China under Grant No.19971090(国家自然科学基金). |
|
| There Is No Minimal r.e. Degree in Every Nonzero [a]∈ R/M |
|
ZHANG Zai yue,SUI Yue fei
|
| Abstract: |
| It is proved that given any nonrecursive r.e. degree a, there exist r.e. degrees c
|
| Key words: Turing degree recursively enumerable set minimal pair4 |
