Lowness for effective Hausdorff dimension

Journal of Mathematical Logic 14 (2):1450011 (2014)
  Copy   BIBTEX

Abstract

We examine the sequences A that are low for dimension, i.e. those for which the effective dimension relative to A is the same as the unrelativized effective dimension. Lowness for dimension is a weakening of lowness for randomness, a central notion in effective randomness. By considering analogues of characterizations of lowness for randomness, we show that lowness for dimension can be characterized in several ways. It is equivalent to lowishness for randomness, namely, that every Martin-Löf random sequence has effective dimension 1 relative to A, and lowishness for K, namely, that the limit of KA/K is 1. We show that there is a perfect [Formula: see text]-class of low for dimension sequences. Since there are only countably many low for random sequences, many more sequences are low for dimension. Finally, we prove that every low for dimension is jump-traceable in order nε, for any ε > 0.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,445

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Continuous higher randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
Computational randomness and lowness.Sebastiaan Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Lowness and Π₂⁰ nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044-1052.
Lowness and $\Pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
On partial randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
Lowness for Kurtz randomness.Noam Greenberg & Joseph S. Miller - 2009 - Journal of Symbolic Logic 74 (2):665-678.

Analytics

Added to PP
2015-09-02

Downloads
59 (#297,715)

6 months
12 (#215,874)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A Perfect Set of Reals with Finite Self-Information.Ian Herbert - 2013 - Journal of Symbolic Logic 78 (4):1229-1246.
Some Consequences of And.Yinhe Peng, W. U. Liuzhen & Y. U. Liang - 2023 - Journal of Symbolic Logic 88 (4):1573-1589.

Add more citations

References found in this work

Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Almost everywhere domination and superhighness.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):462-482.
A Perfect Set of Reals with Finite Self-Information.Ian Herbert - 2013 - Journal of Symbolic Logic 78 (4):1229-1246.

Add more references