Density-1-bounding and quasiminimality in the generic degrees
Peter Cholak, Gregory Igusa

TL;DR
This paper investigates whether all nonzero generic degrees are density-1-bounding, exploring techniques to prove this and examining the properties of quasiminimal degrees, with implications for the structure of generic degrees.
Contribution
It introduces new examples of quasiminimal sets that are not density-1 and extends results to uniform and nonuniform degrees, advancing understanding of generic degree structure.
Findings
Many assumptions suffice to prove density-1-bounding.
Constructed examples of non-density-1 quasiminimal sets.
Characterized the randomness level needed for quasiminimality.
Abstract
We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees: A positive result would prove that there are no minimal generic degrees, and a negative result would prove that there exist minimal pairs in the generic degrees. We consider several techniques for showing that the answer might be positive, and use those techniques to prove that a wide class of assumptions is sufficient to prove density-1-bounding. We also consider a historic difficulty in constructing a potential counterexample: By previous results \cite{I1} any generic degree that is not density-1-bounding must be quasiminimal, so in particular, any construction of a non-density-1-bounding generic degree must use a method that is able to…
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 · semigroups and automata theory · Advanced Topology and Set Theory
