Weakly useful sequences

An infinite binary sequence x is defined to be 1. strongly useful if there is a recursive time bound within which every recursive sequence is Turing reducible to x; and 2. weakly useful if there is a recursive time bound within which all the sequences in a non-measure 0 subset of the set of recursive sequences are Turing reducible to x.

[1]  C. Jockusch.  Degrees in Which the Recursive Sets are Uniformly Recursive , 1972, Canadian Journal of Mathematics.

[2]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[4]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[5]  Robert I. Soare,et al.  Degrees of members of Π10 classes , 1972 .

[6]  Jack H. Lutz,et al.  Weakly hard problems , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[7]  Jack H. Lutz,et al.  Computational Depth and Reducibility , 1993, Theor. Comput. Sci..

[8]  Rolf Herken,et al.  The Universal Turing Machine: A Half-Century Survey , 1992 .

[9]  Charles H. Bennett.  Logical depth and physical complexity , 1988 .

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

[11]  Jack H. Lutz,et al.  Recursive Computational Depth , 1997, Inf. Comput..

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

[13]  G. Sacks.  Degrees of unsolvability , 1965 .

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

[15]  Jack H. Lutz.  Almost Everywhere High Nonuniform Complexity , 1992, J. Comput. Syst. Sci..

[16]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .