Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension

Published:2011-01 Issue:1 Volume:226 Page:373-384
ISSN:0001-8708
Container-title:Advances in Mathematics
language:en
Short-container-title:Advances in Mathematics

Author:

Miller Joseph S.

Publisher

Elsevier BV

Subject

General Mathematics

Reference27 articles.

1. Effective strong dimension in algorithmic information and computational complexity;Athreya,2004

2. Constructive dimension and Turing degrees;Bienvenu;Theory Comput. Syst.,2009

3. A theory of program size formally identical to information theory;Chaitin;J. Assoc. Comput. Mach.,1975

4. R. Downey, D. Hirschfeldt, Algorithmic Randomness and Complexity, Springer-Verlag, Berlin, in press.

5. Turing degrees of reals of positive effective packing dimension;Downey;Inform. Process. Lett.,2008

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Growth and irreducibility in path-incompressible trees;Information and Computation;2024-03

2. Strong Medvedev Reducibilities and the KL-Randomness Problem;Revolutions and Revelations in Computability;2022

3. Optimal bounds for single-source Kolmogorov extractors;Transactions of the American Mathematical Society;2019-11-12

4. Extracting randomness within a subset is hard;European Journal of Mathematics;2019-08-21

5. Compression of Data Streams Down to Their Information Content;IEEE Transactions on Information Theory;2019-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP