Random strings and tt-degrees of Turing complete C.E. sets

We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the degree~0, even within the c.e. truth-table degrees, but when taking the meet over all such truth-table degrees, the infinite meet is indeed~0. The latter result proves a conjecture of Allender, Friedman and Gasarch. We also show that there are two Turing complete c.e. sets whose truth-table degrees form a minimal pair.

[1]  Peter Gacs,et al.  Lecture notes on descriptional complexity and randomness , 2014, ArXiv.

[2]  Andrej Muchnik,et al.  Kolmogorov entropy in the context of computability theory , 2002, Theor. Comput. Sci..

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

[4]  Eric Allender.  Curiouser and Curiouser: The Link between Incompressibility and Complexity , 2012, CiE.

[5]  A. N. Degtev.  tt- andm-degrees , 1973 .

[6]  Klaus Ambos-Spies,et al.  Cupping and noncapping in the r.e. weak truth table and turing degrees , 1985, Arch. Math. Log..

[7]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[8]  Leonid A. Levin,et al.  Some theorems on the algorithmic approach to probability theory and information theory: (1971 Dissertation directed by A.N. Kolmogorov) , 2010, Ann. Pure Appl. Log..

[9]  Claus-Peter Schnorr,et al.  The process complexity and effective random tests. , 1972, STOC.

[10]  Eric Allender,et al.  What can be efficiently reduced to the Kolmogorov-random strings? , 2006, Ann. Pure Appl. Log..

[11]  Rodney G. Downey,et al.  Degree theoretic definitions of the low2 recursively enumerable sets , 1995, Journal of Symbolic Logic.

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

[13]  Eric Allender,et al.  Limits on the computational power of random strings , 2013, Inf. Comput..

[14]  Eric Allender,et al.  Power from random strings , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  G. N. Kobzev.  ON tt-DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES , 1979 .

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

[17]  Lance Fortnow,et al.  Derandomizing from Random Strings , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[18]  Carl G. Jockusch,et al.  Relationships between reducibilities , 1969 .

[19]  Denis R. Hirschfeldt,et al.  Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[20]  Martin Kummer.  On the Complexity of Random Strings (Extended Abstract) , 1996, STACS.