中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Universal computably enumerable sets and initial segment prefix-free complexity
Author: Barmpalias, George
Keyword: Universal sets ; Computably enumerable ; Kolmogorov complexity ; Initial segment complexity
Source: INFORMATION AND COMPUTATION
Issued Date: 2013
Volume: 233, Pages:41-59
Indexed Type: SCI
Department: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China.
Abstract: 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.
English Abstract: 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.
Language: 英语
WOS ID: WOS:000330258800004
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16894
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Barmpalias, George. Universal computably enumerable sets and initial segment prefix-free complexity[J]. INFORMATION AND COMPUTATION,2013-01-01,233:41-59.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Barmpalias, George]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Barmpalias, George]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace