Partial randomness and dimension of recursively enumerable reals
Kohtaro Tadaki

TL;DR
This paper extends the concept of randomness for recursively enumerable reals by introducing partial randomness parameterized by a real T in (0,1], providing ten equivalent characterizations and linking it to the dimension of these reals.
Contribution
It generalizes existing randomness characterizations to partial randomness and establishes ten equivalent conditions, also connecting these to the Hausdorff dimension of r.e. reals.
Findings
Ten equivalent characterizations of partial randomness.
Characterizations of the dimension of r.e. reals.
Link between partial randomness and Hausdorff dimension.
Abstract
A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in various ways using each of the notions; program-size complexity, Martin-L\"{o}f test, Chaitin \Omega number, the domination and \Omega-likeness of \alpha, the universality of a computable, increasing sequence of rationals which converges to \alpha, and universal probability. In this paper, we generalize these characterizations of randomness over the notion of partial randomness by parameterizing each of the notions above by a real T in (0,1], where the notion of partial randomness is a stronger representation of the compression rate by means of program-size complexity. As a result, we present ten equivalent characterizations of the partial randomness of an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
