Universal computably enumerable sets and initial segment prefix-free complexity
文献类型：期刊论文
| 作者 | Barmpalias, George |
| 刊名 | INFORMATION AND COMPUTATION
 |
| 出版日期 | 2013 |
| 卷号 | 233页码:41-59 |
| 关键词 | Universal sets Computably enumerable Kolmogorov complexity Initial segment complexity |
| ISSN号 | 0890-5401 |
| 中文摘要 | We show that there are Turing complete computably enumerable sets of arbitrarily low nontrivial initial segment prefix-free complexity. In particular, given any computably enumerable set A with nontrivial prefix-free initial segment complexity, there exists a Turing complete computably enumerable set B with complexity strictly less than the complexity of A. On the other hand it is known that sets with trivial initial segment prefix-free complexity are not Turing complete. Moreover we give a generalization of this result for any finite collection of computably enumerable sets A(i), i < k with nontrivial initial segment prefix-free complexity. An application of this gives a negative answer to a question from a monograph by Downey and Hirschfeldt (also raised in an article by Merkle and Stephan) which asked for minimal pairs in the structure of the c.e. reals ordered by their initial segment prefix-free complexity. Further consequences concern various notions of degrees of randomness. For example, the Solovay degrees and the K-degrees of computably enumerable reals and computably enumerable sets are not elementarily equivalent. Also, the degrees of randomness of c.e. reals based on plain and prefix-free complexity are not elementarily equivalent; the same holds for the degrees of c.e. sets. (C) 2013 Elsevier Inc. All rights reserved. |
| 英文摘要 | We show that there are Turing complete computably enumerable sets of arbitrarily low nontrivial initial segment prefix-free complexity. In particular, given any computably enumerable set A with nontrivial prefix-free initial segment complexity, there exists a Turing complete computably enumerable set B with complexity strictly less than the complexity of A. On the other hand it is known that sets with trivial initial segment prefix-free complexity are not Turing complete. Moreover we give a generalization of this result for any finite collection of computably enumerable sets A(i), i < k with nontrivial initial segment prefix-free complexity. An application of this gives a negative answer to a question from a monograph by Downey and Hirschfeldt (also raised in an article by Merkle and Stephan) which asked for minimal pairs in the structure of the c.e. reals ordered by their initial segment prefix-free complexity. Further consequences concern various notions of degrees of randomness. For example, the Solovay degrees and the K-degrees of computably enumerable reals and computably enumerable sets are not elementarily equivalent. Also, the degrees of randomness of c.e. reals based on plain and prefix-free complexity are not elementarily equivalent; the same holds for the degrees of c.e. sets. (C) 2013 Elsevier Inc. All rights reserved. |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000330258800004 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16894]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Barmpalias, George. Universal computably enumerable sets and initial segment prefix-free complexity[J]. INFORMATION AND COMPUTATION,2013,233:41-59. |
| APA | Barmpalias, George.(2013).Universal computably enumerable sets and initial segment prefix-free complexity.INFORMATION AND COMPUTATION,233,41-59. |
| MLA | Barmpalias, George."Universal computably enumerable sets and initial segment prefix-free complexity".INFORMATION AND COMPUTATION 233(2013):41-59. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。