Intrinsic complexity of recursive functions on natural numbers with standard order
Nikolay Bazhenov, Dariusz Kaloci\'nski, Micha{\l} Wroc{\l}awski

TL;DR
This paper advances the understanding of the intrinsic complexity spectra of recursive functions on natural numbers, providing criteria for their classification and expanding the known spectra beyond previous limitations.
Contribution
It offers a more complete classification of the intrinsic complexity spectra of unary recursive functions, introducing criteria and broadening the known spectra to include new cases.
Findings
Identifies criteria for functions to have spectra equal to computable, c.e., or Δ₂ degrees.
Shows existence of functions with spectra containing all c.e. degrees but not all Δ₂ degrees.
Expands the classification of intrinsic complexity spectra for recursive functions.
Abstract
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate the intrinsic complexity of unary total recursive functions on nonnegative integers with standard order. According to existing results, possible spectra of such functions include three sets consisting of precisely: the computable degree, all c.e. degrees and all degrees. These results, however, fall far short of the full classification. In this paper, we obtain a more complete picture by giving a few criteria for a function to have intrinsic complexity equal to one of the three candidate sets of degrees. Our investigations are based on the notion of block functions and a broader class of quasi-block functions beyond which all functions 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.
