Affiliation:
1. Volga Region Scientific-Educational Centre of Mathematics, Kazan (Volga Region) Federal University, 420008, 35 Kremlevskaya Street, Kazan Russian Federation
Abstract
The Arslanov completeness criterion says that a c.e. set A is Turing complete if and only there exists an A-computable function f without fixed points, i.e. a function f such that W f ( x ) ≠ W x for each integer x. Recently, Barendregt and Terwijn proved that the completeness criterion remains true if we replace the Gödel numbering x ↦ W x with an arbitrary precomplete computable numbering. In this paper, we prove criteria for noncomputability and highness of c.e. sets in terms of (pre)complete computable numberings and fixed point properties. We also find some precomplete and weakly precomplete numberings of arbitrary families computable relative to Turing complete and non-computable c.e. oracles respectively.
Subject
Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science
Reference27 articles.
1. Inductive inference and computable numberings;Ambos-Spies;Theoretical Comp. Sci.,2011
2. A Survey on Universal Computably Enumerable Equivalence Relations
3. On some generalizations of the fixed point theorem;Arslanov;Sov. Math. (Iz. VUZ),1981
4. Completeness criteria for recursively enumerable sets and some general theorems on fixed points;Arslanov;Sov. Math. (Iz. VUZ),1977
5. On weakly pre-complete positive equivalences;Badaev;Sib. Math. J.,1991
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献