
TL;DR
This paper explores the measure-theoretic properties of various classes of generic reals in computability theory, revealing conditions under which these sets have positive measure based on gauge functions and Turing ideals.
Contribution
It establishes precise measure conditions for different types of generic reals, connecting gauge functions with the structure of Turing ideals in computability theory.
Findings
$ ext{Gamma}$-Cohen generics have positive measure iff gauge function is not dominated by all in $ ext{Gamma}$
$ ext{Gamma}$-Mathias and $ ext{Gamma}$-Sacks generics have positive measure iff gauge function eventually dominates all in $ ext{Gamma}$
Provides comparison between the measure of generic sets and their computational properties
Abstract
This paper investigates the Hausdorff measure of certain sets of generics in computability theory. Let be the Turing ideal in which we take the dense open sets. The set of -Cohen generics has measure positive if and only if the gauge function is not dominated by every element in , under some mild restrictions on the gauge function. The set of -Mathias generics and the set of -Sacks generics have measure positive if and only if the gauge function eventually dominates every element in . This gives some comparison between the behavior of reals in the set and the measure of the set.
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 · Limits and Structures in Graph Theory
