Partial functions and domination

The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function {\phi} and almost every x in the domain of {\phi} there is a y in the domain of {\psi} with y {\phi}(x). While there is a full {\pi}01-class of nonrecursive sets where no set is pdominant, there is no {\pi}01-class containing only pdominant sets. No weakly 2-generic set is pdominant while there are pdominant 1-generic sets below K. The halves of Chaitin's {\Omega} are pdominant. No set which is low for Martin-L\"of random is pdominant. There is a low r.e. set which is pdominant and a high r.e. set which is not pdominant.

[1]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[2]  C. Jockusch.  Degrees of generic sets , 1980 .

[3]  C. Jockusch.  Simple Proofs of Some Theorems on High Degrees of Unsolvability , 1977, Canadian Journal of Mathematics.

[4]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[5]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[6]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[7]  Donald A. Martin,et al.  The Degrees of Hyperimmune Sets , 1968 .

[8]  C. Chong,et al.  THE METAMATHEMATICS OF STABLE RAMSEY'S THEOREM FOR PAIRS , 2014 .

[9]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[10]  Richard Friedberg,et al.  A criterion for completeness of degrees of unsolvability , 1957, Journal of Symbolic Logic.

[11]  Donald A. Martin,et al.  Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .

[12]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[13]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[14]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[15]  Frank Stephan,et al.  A reducibility related to being hyperimmune-free , 2014, Ann. Pure Appl. Log..

[16]  Martin Kummer.  A Proof of Beigel's Cardinality Conjecture , 1992, J. Symb. Log..

[17]  Donald A. Martin,et al.  Completeness, the recursion theorem, and effectively simple sets , 1966 .

[18]  Guohua Wu,et al.  Randomness and universal machines , 2006, J. Complex..

[19]  P. Odifreddi.  Classical recursion theory , 1989 .

[20]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[21]  Valentina S. Harizanov,et al.  Frequency Computations and the Cardinality Theorem , 1992, J. Symb. Log..

[22]  James C. Owings,et al.  A cardinality version of Beigel's nonspeedup theorem , 1989, Journal of Symbolic Logic.

[23]  Cristian Claude,et al.  Information and Randomness: An Algorithmic Perspective , 1994 .

[24]  G. Chaitin.  Incompleteness theorems for random reals , 1987 .

[25]  A. Nies.  Computability and randomness , 2009 .