Any FIP real computes a 1-generic
Peter Cholak, Rod Downey, and Greg Igusa

TL;DR
The paper constructs computable sequences of reals to show that any real computing a maximal finite intersection property subsequence can also compute a Cohen 1-generic, extending to 2IP cases.
Contribution
It demonstrates that any real computing a FIP or 2IP maximal subsequence can also compute a Cohen 1-generic, establishing a new connection between these concepts.
Findings
Any real computing a FIP maximal subsequence can compute a Cohen 1-generic.
Extension of the result to 2IP cases.
Provides a new link between computability and genericity.
Abstract
We construct a computable sequence of computable reals such that any real that can compute a subsequence that is maximal with respect to the finite intersection property can also compute a Cohen 1-generic. This is extended to establish the same result with 2IP in place of FIP.
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
