中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
analogues of chaitin's omega in the computably enumerable sets
Author: Barmpalias G. ; H&# ; lzl R. ; Lewis A.E.M. ; Merkle W.
Keyword: Computer applications ; Data processing
Source: Information Processing Letters
Issued Date: 2013
Volume: 113, Issue:5-6, Pages:171-178
Indexed Type: EI
Department: (1) State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences P.O. Box 8718 Beijing 100190 China; (2) Bureau 6A35 LIAFA 175 rue du Chevaleret 75013 Paris France; (3) School of Mathematics University of Leeds LS2 9JT Leeds United Kingdom; (4) Institut für Informatik Ruprecht-Karls-Universität Heidelberg Germany
Abstract: 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.
English Abstract: 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.
Language: 英语
WOS ID: WOS:000316037700005
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15228
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Barmpalias G.,H&#,lzl R.,et al. analogues of chaitin's omega in the computably enumerable sets[J]. Information Processing Letters,2013-01-01,113(5-6):171-178.
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 G.]'s Articles
[H&#]'s Articles
[lzl R.]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Barmpalias G.]‘s Articles
[H&#]‘s Articles
[lzl R.]‘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