A Perfect Set of Reals with Finite Self-Information

Journal of Symbolic Logic 78 (4):1229-1246 (2013)
  Copy   BIBTEX

Abstract

We examine a definition of the mutual information of two reals proposed by Levin in [5]. The mutual information iswhereK is the prefix-free Kolmogorov complexity. A realAis said to have finite self-information ifI is finite. We give a construction for a perfect Π10class of reals with this property, which settles some open questions posed by Hirschfeldt and Weber. The construction produces a perfect set of reals withK≤+KA+f for any given Δ20fwith a particularly nice approximation and for a specific choice of f it can also be used to produce a perfect Π10set of reals that are low for effective Hausdorff dimension and effective packing dimension. The construction can be further adapted to produce a single perfect set of reals that satisfyK≤+KA+f for allfin a ‘nice’ class of Δ20functions which includes all Δ20orders.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

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

Reals n-Generic Relative to Some Perfect Tree.Bernard A. Anderson - 2008 - Journal of Symbolic Logic 73 (2):401 - 411.
Complexity of reals in inner models of set theory.Boban Velickovic & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 92 (3):283-295.
A dedekind finite borel set.Arnold W. Miller - 2011 - Archive for Mathematical Logic 50 (1-2):1-17.
Mapping a set of reals onto the reals.Arnold W. Miller - 1983 - Journal of Symbolic Logic 48 (3):575-584.
Regular reals.Guohua Wu - 2005 - Mathematical Logic Quarterly 51 (2):111-119.
Cohen reals from small forcings.Janusz Pawlikowski - 2001 - Journal of Symbolic Logic 66 (1):318-324.
Needed reals and recursion in generic reals.Andreas Blass - 2001 - Annals of Pure and Applied Logic 109 (1-2):77-88.
We are better off without perfect perception.Eli Brenner & Jeroen B. J. Smeets - 2001 - Behavioral and Brain Sciences 24 (2):215-216.
On effectively closed sets of effective strong measure zero.Kojiro Higuchi & Takayuki Kihara - 2014 - Annals of Pure and Applied Logic 165 (9):1445-1469.
Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
Players' information in extensive games.Giacomo Bonanno - 1992 - Mathematical Social Sciences 24 (1):35-48.

Analytics

Added to PP
2016-06-30

Downloads
18 (#832,773)

6 months
10 (#268,644)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.

Add more references