analogues of chaitin's omega in the computably enumerable sets
文献类型：期刊论文
| 作者 | Barmpalias G. ; H&# ; lzl R. ; Lewis A.E.M. ; Merkle W. |
| 刊名 | Information Processing Letters
 |
| 出版日期 | 2013 |
| 卷号 | 113期号:5-6页码:171-178 |
| 关键词 | Computer applications Data processing |
| ISSN号 | 0020-0190 |
| 中文摘要 | We show that there are computably enumerable (c.e.) sets with maximum initial segment Kolmogorov complexity amongst all c.e. sets (with respect to both the plain and the prefix-free version of Kolmogorov complexity). These c.e. sets belong to the weak truth table degree of the halting problem, but not every weak truth table complete c.e. set has maximum initial segment Kolmogorov complexity. Moreover, every c.e. set with maximum initial segment prefix-free complexity is the disjoint union of two c.e. sets with the same property; and is also the disjoint union of two c.e. sets of lesser initial segment complexity. © 2013 Elsevier B.V. |
| 英文摘要 | We show that there are computably enumerable (c.e.) sets with maximum initial segment Kolmogorov complexity amongst all c.e. sets (with respect to both the plain and the prefix-free version of Kolmogorov complexity). These c.e. sets belong to the weak truth table degree of the halting problem, but not every weak truth table complete c.e. set has maximum initial segment Kolmogorov complexity. Moreover, every c.e. set with maximum initial segment prefix-free complexity is the disjoint union of two c.e. sets with the same property; and is also the disjoint union of two c.e. sets of lesser initial segment complexity. © 2013 Elsevier B.V. |
| 收录类别 | EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000316037700005 |
| 公开日期 | 2013-09-17 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15228]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Barmpalias G.,H&#,lzl R.,et al. analogues of chaitin's omega in the computably enumerable sets[J]. Information Processing Letters,2013,113(5-6):171-178. |
| APA | Barmpalias G.,H&#,lzl R.,Lewis A.E.M.,&Merkle W..(2013).analogues of chaitin's omega in the computably enumerable sets.Information Processing Letters,113(5-6),171-178. |
| MLA | Barmpalias G.,et al."analogues of chaitin's omega in the computably enumerable sets".Information Processing Letters 113.5-6(2013):171-178. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。