Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Control structures in hypothesis spaces: the influence on learning
Theoretical Computer Science
Noncomputable spectral sets
Post's Programme for the Ershov Hierarchy
Journal of Logic and Computation
An Introduction to Kolmogorov Complexity and Its Applications
An Introduction to Kolmogorov Complexity and Its Applications
Kolmogorov complexity and the recursion theorem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Immunity properties and the n-C.E. hierarchy
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Characteristics of minimal effective programming systems
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular properties relating to the domain of the corresponding functions are investigated like the set DEQ of all pairs of indices of functions with the same domain, the set DMIN of all minimal indices of sets and DMIN^@? of all indices which are minimal with respect to equality of the domain modulo finitely many differences. A partial solution to a question of Schaefer is obtained by showing that for every universal numbering with the Kolmogorov property, the set DMIN^@? is Turing equivalent to the double jump of the halting problem. Furthermore, it is shown that the join of DEQ and the halting problem is Turing equivalent to the jump of the halting problem and that there are numberings for which DEQ itself has 1-generic Turing degree.