| 关于递归控制Turing可化归性 |
| |
| 引用本文： | 谷新民. 关于递归控制Turing可化归性[J]. 江苏大学学报(自然科学版), 1996, 0(5) |
| |
| 作者姓名： | 谷新民 |
| |
| 作者单位： | 常熟电视大学 |
| |
| 摘 要： | 证明了“递归控制Ｔｕｒｉｎｇ可化归性”（简称ｒｃｔ－可化归性）崩溃成平凡情形，即证明了任何两个有穷集合或任何两个无穷的递归可枚举集合都分别是ｒｃｔ－等价的，而它们两者之间则又不是ｒｃｔ－等价的．也即有且只有两个递归可枚举的ｒｃｔ－度．从而ｒｃｔ－可化归性不是通常递归论意义下的合适的可化归性．
|
| 关 键 词： | 递归函数，递归可枚举集／递归控制Turing可化归性 |
A Note on the Recursively Controlled Turing Reducibility |
| |
| Gu Xingming. A Note on the Recursively Controlled Turing Reducibility[J]. Journal of Jiangsu University:Natural Science Edition, 1996, 0(5) |
| |
| Authors: | Gu Xingming |
| |
| Affiliation: | Gu Xingming |
| |
| Abstract: | The author prove that the recursively controlled Turing(RCT)reducibility,i. e. any two finite sets and any two infinite recursively enumerablesets are ret-equivalent respectively, i. e. there are only two r. e, ret-degrees,hence rot-reducibility is not a reasonable reducibility in the sense of recursiontheory. |
| |
| Keywords: | recursiw runctions recursively enumerable sets/recursivelycontrolled Turing reducibility |
| 本文献已被 CNKI 等数据库收录！ |
