Degree Spectra of Relations on a Cone
Matthew Harrison-Trainor

TL;DR
This paper studies the degree spectra of relations on structures with an emphasis on cones, revealing minimal spectra, differences in complexity levels, and answering open questions about the nature of these spectra in computability theory.
Contribution
It introduces the concept of degree spectra on a cone, analyzes their properties, and provides new results on the complexity of spectra for various degrees and structures.
Findings
Existence of a minimal non-trivial degree spectrum of c.e. degrees on a cone.
Counterexample showing degree spectra on a cone can be incomparable in complexity.
Positive answer to a question about degree spectra containing all 2-CEA degrees.
Abstract
Let be a mathematical structure with an additional relation . We are interested in the degree spectrum of , either among computable copies of when is a "natural" structure, or (to make this rigorous) among copies of computable in a large degree \textbf{d}. We introduce the partial order of degree spectra \textit{on a cone} and begin the study of these objects. Using a result of Harizanov---that, assuming an effectiveness condition on and , if is not intrinsically computable, then its degree spectrum contains all c.e.\ degrees---we see that there is a minimal non-trivial degree spectrum on a cone, consisting of the c.e.\ degrees. We show that this does not generalize to d.c.e.\ degrees by giving an example of two incomparable degree spectra on a cone. We also give a partial answer to a question of…
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 · Digital Image Processing Techniques
