The interplay of classes of algorithmically random objects
Quinn Culver, Christopher P. Porter

TL;DR
This paper explores the relationships between different classes of algorithmically random objects such as closed sets, functions, and measures on the Cantor space, using preservation of randomness principles to answer open questions and establish new correspondences.
Contribution
It proves that random closed sets are exactly the zeros of random continuous functions, constructs a measure linking random closed sets and measures, and analyzes the measure of ranges of random functions.
Findings
Random closed sets are zeros of random continuous functions.
The collection of random continuous functions is not closed under composition.
The Lebesgue measure of the range of a random continuous function lies in (0,1).
Abstract
We study algorithmically random closed subsets of , algorithmically random continuous functions from to , and algorithmically random Borel probability measures on , especially the interplay between these three classes of objects. Our main tools are preservation of randomness and its converse, the no randomness ex nihilo principle, which say together that given an almost-everywhere defined computable map between an effectively compact probability space and an effective Polish space, a real is Martin-L\"of random for the pushforward measure if and only if its preimage is random with respect to the measure on the domain. These tools allow us to prove new facts, some of which answer previously open questions, and reprove some known results more simply. Our main results are the following. First we answer an open question of Barmapalias, Brodhead,…
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.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Benford’s Law and Fraud Detection
