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

21Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We construct a Δ20 infinite binary sequence with effective Hausdorff dimension 1/2 that does not compute a sequence of higher dimension. Introduced by Lutz, effective Hausdorff dimension can be viewed as a measure of the information density of a sequence. In particular, the dimension of A∈2ω is the lim inf of the ratio between the information content and length of initial segments of A. Thus the main result demonstrates that it is not always possible to extract information from a partially random source to produce a sequence that has higher information density. © 2010 Elsevier Inc.

Cite

CITATION STYLE

APA

Miller, J. S. (2011). Extracting information is hard: A Turing degree of non-integral effective Hausdorff dimension. Advances in Mathematics, 226(1), 373–384. https://doi.org/10.1016/j.aim.2010.06.024

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free