A $wtt$-introimmune set in \texorpdfstring{$\Pi^0_1$}{Pi01} and introimmunity for several reducibilities
Patrizio Cintioli

TL;DR
This paper establishes the existence and non-existence of introimmune sets within various computational hierarchies and reducibilities, advancing understanding of immunity properties in computability theory.
Contribution
It proves the existence of a $ ext{WTT}$-introimmune set in $ ext{Pi}^0_1$, and explores introimmunity for several reducibilities, delineating the boundaries within the arithmetical hierarchy.
Findings
Existence of a $ ext{WTT}$-introimmune set in $ ext{Pi}^0_1$
Existence of $ ext{Delta}^0_2$ sets that are $bs$- and $D$-introimmune
No infinite $ ext{Pi}^0_1$ set is $Q$-introimmune
Abstract
We prove that there exists a weak truth-table introimmune set in the class , settling the question left open in previous work of whether the known existence result can be improved to . Since sets cannot be immune, this is best possible for weak truth-table introimmunity. We also study introimmunity for Jockusch's bounded-search reducibility and Andersen's Dartmouth reducibility , proving the existence of sets that are -introimmune and -introimmune; hence there also exists a -introimmune set. We next consider the classical reducibility , which is not contained in on all subsets of . We show that no infinite set is -introimmune, while a -introimmune set does exist. Thus the existence of -introimmune sets is best possible…
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
TopicsComplexity and Algorithms in Graphs · Computability, Logic, AI Algorithms · Advanced Graph Theory Research
