Abstract
We examine several notions of randomness for elements in a given class . Such an effectively closed subset of may be viewed as the set of infinite paths through the tree of extendible nodes of , i.e., those finite strings that extend to a member of , so one approach to defining a random member of is to randomly produce a path through using a sufficiently random oracle for advice. In addition, this notion of randomness for elements of may be induced by a map from onto that is computable relative to , and the notion even has a characterization in term of Kolmogorov complexity. Another approach is to define a relative measure on by conditionalizing the Lebesgue measure on , which becomes interesting if has Lebesgue measure 0. Lastly, one can alternatively define a notion of incompressibility for members of in terms of the amount of branching at levels of . We explore some notions of homogeneity for classes, inspired by work of van Lambalgen. A key finding is that in a specific class of sufficiently homogeneous classes , each of these approaches coincides. We conclude with a discussion of random members of classes of positive measure.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.