Affiliation:
1. Department of Mathematics, Radboud University Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands
Abstract
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings, lowness and relative precompleteness coincide with being computable. We also study the complexity of Skolem functions arising from Arslanov’s completeness criterion with parameters. We show that for suitably divisible numberings, these Skolem functions have the maximal possible Turing degree. In particular this holds for the standard numberings of the partial computable functions and the c.e. sets.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference21 articles.
1. A Survey on Universal Computably Enumerable Equivalence Relations
2. Universal computably enumerable equivalence relations;Andrews;Journal of Symbolic Logic,2014
3. Jumps of computably enumerable equivalence relations;Andrews;Annals of Pure and Applied Logic,2018
4. Joins and meets in the structure of ceers;Andrews;Computability,2019
5. On some generalizations of the fixed point theorem;Arslanov;Soviet Mathematics (Izvestiya VUZ. Matematika),1981
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献