中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
Author: Barmpalias, G ; Fang, N ; Lewis-Pye, A
Keyword: Halting probability ; Oracle use ; Oracles ; Optimal ; Asymptotic ; Kolmogorov ; Completeness ; Computability ; Complexity
Source: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Issued Date: 2016
Volume: 82, Issue:8, Pages:1283-1299
Indexed Type: SCI
Department: Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.Victoria Univ Wellington, Sch Math Stat & Operat Res, Wellington, New Zealand. [Fang, Nan] Heidelberg Univ, Inst Informat, D-69115 Heidelberg, Germany. [Lewis-Pye, Andrew] London Sch Econ, Dept Math, Columbia House,Houghton St, London WC2A 2AE, England.
Abstract: We characterise the asymptotic upper bounds on the use of Chaitin's Omega in oracle computations of halting probabilities (i.e. c.e. reals). We show that the following two conditions are equivalent for any computable function h such that h(n) - n is non decreasing: (1) h(n) - n is an information content measure, i.e. the series Sigma(n) 2(n-h(n)) converges, (2) for every c.e. real alpha there exists a Turing functional via which Omega computes alpha with use bounded by h. We also give a similar characterisation with respect to computations of c.e. sets from Omega, by showing that the following are equivalent for any computable non-decreasing function g: (1) g is an information-content measure, (2) for every c.e. set A, Omega computes A with use bounded by g. Further results and some connections with Solovay functions (studied by a number of authors [38,3,26,11]) are given. (C) 2016 Elsevier Inc. All rights reserved.
English Abstract: We characterise the asymptotic upper bounds on the use of Chaitin's Omega in oracle computations of halting probabilities (i.e. c.e. reals). We show that the following two conditions are equivalent for any computable function h such that h(n) - n is non decreasing: (1) h(n) - n is an information content measure, i.e. the series Sigma(n) 2(n-h(n)) converges, (2) for every c.e. real alpha there exists a Turing functional via which Omega computes alpha with use bounded by h. We also give a similar characterisation with respect to computations of c.e. sets from Omega, by showing that the following are equivalent for any computable non-decreasing function g: (1) g is an information-content measure, (2) for every c.e. set A, Omega computes A with use bounded by g. Further results and some connections with Solovay functions (studied by a number of authors [38,3,26,11]) are given. (C) 2016 Elsevier Inc. All rights reserved.
Language: 英语
WOS ID: WOS:000380383700005
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/17291
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega.pdf(571KB)----限制开放 联系获取全文

Recommended Citation:
Barmpalias, G,Fang, N,Lewis-Pye, A. Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES,2016-01-01,82(8):1283-1299.
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
[Fang, N]'s Articles
[Lewis-Pye, A]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Barmpalias, G]‘s Articles
[Fang, N]‘s Articles
[Lewis-Pye, A]‘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