Hostname: page-component-7c8c6479df-7qhmt Total loading time: 0 Render date: 2024-03-29T12:20:06.225Z Has data issue: false hasContentIssue false

MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS

Published online by Cambridge University Press:  04 September 2020

BENOIT MONIN
Affiliation:
LACL, IUT SÉNART/FONTAINEBLEAU UNIVERSITÉ PARIS-EST CRÉTEILFRANCEE-mail: benoit.monin@computability.fr
ANDRÉ NIES
Affiliation:
DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF AUCKLANDNEW ZEALANDE-mail: andre@cs.auckland.ac.nz

Abstract

A mass problem is a set of functions $\omega \to \omega $ . For mass problems ${\mathcal {C}}, {\mathcal {D}}$ , one says that ${\mathcal {C}}$ is Muchnik reducible to ${\mathcal {D}}$ if each function in ${\mathcal {C}}$ is computed by a function in ${\mathcal {D}}$ . In this paper we study some highness properties of Turing oracles, which we view as mass problems. We compare them with respect to Muchnik reducibility and its uniform strengthening, Medvedev reducibility.

For $p \in [0,1]$ let ${\mathcal {D}}(p)$ be the mass problem of infinite bit sequences y (i.e., $\{0,1\}$ -valued functions) such that for each computable bit sequence x, the bit sequence $ x {\,\leftrightarrow\,} y$ has asymptotic lower density at most p (where $x {\,\leftrightarrow\,} y$ has a $1$ in position n iff $x(n) = y(n)$ ). We show that all members of this family of mass problems parameterized by a real p with $0 < p <1/2 $ have the same complexity in the sense of Muchnik reducibility. We prove this by showing Muchnik equivalence of the problems ${\mathcal {D}}(p)$ with the mass problem $\text {IOE}({2^{2}}^{n})$ ; here for an order function h, the mass problem $\text {IOE}(h)$ consists of the functions f that agree infinitely often with each computable function bounded by h. This result also yields a new version of the proof to of the affirmative answer to the “Gamma question” due to the first author: $\Gamma (A)< 1/2$ implies $\Gamma (A)=0$ for each Turing oracle A.

As a dual of the problem ${\mathcal {D}}(p)$ , define ${\mathcal {B}}(p)$ , for $0 \le p < 1/2$ , to be the set of bit sequences y such that $\underline \rho (x {\,\leftrightarrow\,} y)> p$ for each computable set x. We prove that the Medvedev (and hence Muchnik) complexity of the mass problems ${\mathcal {B}}(p)$ is the same for all $p \in (0, 1/2)$ , by showing that they are Medvedev equivalent to the mass problem of functions bounded by ${2^{2}}^{n}$ that are almost everywhere different from each computable function.

Next, together with Joseph Miller, we obtain a proper hierarchy of the mass problems of type $\text {IOE}$ : we show that for any order function g there exists a faster growing order function $h $ such that $\text {IOE}(h)$ is strictly above $\text {IOE}(g)$ in the sense of Muchnik reducibility.

We study cardinal characteristics in the sense of set theory that are analogous to the highness properties above. For instance, ${\mathfrak {d}} (p)$ is the least size of a set G of bit sequences such that for each bit sequence x there is a bit sequence y in G so that $\underline \rho (x {\,\leftrightarrow\,} y)>p$ . We prove within ZFC all the coincidences of cardinal characteristics that are the analogs of the results above.

Type
Article
Copyright
© The Association for Symbolic Logic 2020

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Andrews, U., Cai, M., Diamondstone, D., Jockusch, C., and Lempp, S., Asymptotic density, computable traceability, and 1-randomness . Fundamenta Mathematicae , vol. 234 (2016), no. 1, pp. 4153.Google Scholar
Bartoszyński, T. and Judah, H., Set Theory on the Structure of the Real Line , A K Peters, Wellesley, MA, 1995.Google Scholar
Blass, A., Combinatorial cardinal characteristics of the continuum , Handbook of Set Theory, vol. 1 (Foreman, M. and Kanamori, A., editors), Springer, New York, 2010, pp. 395489.10.1007/978-1-4020-5764-9_7CrossRefGoogle Scholar
Brendle, J., Brooke-Taylor, A., Ng, K. M., and Nies, A., An analogy between cardinal characteristics and highness properties of oracles. Proceedings of the 13th Asian Logic Conference, Guangzhou, China (X. Zhao, Q. Feng, B. Kim, and L. Yu, editors), World Scientific, 2013, pp. 1–28. Available at http://arxiv.org/abs/1404.2839.Google Scholar
Elias, P., Error-correcting codes for list decoding . IEEE Transactions on Information Theory , vol. 37 (1991), no. 1, pp. 512.CrossRefGoogle Scholar
Nies, A. (editor), Logic Blog, 2015. Available at http://arxiv.org/abs/1602.04432.Google Scholar
Nies, A., (editor), Logic Blog, 2016. Available at http://arxiv.org/abs/1703.01573.Google Scholar
Nies, A., (editor), Logic Blog, 2017. Available at http://arxiv.org/abs/1804.05331.Google Scholar
Greenberg, N., Kuyper, R., and Turetsky, D., Cardinal invariants, non-lowness classes, and Weihrauch reducibility . Computability , vol. 8 (2019), no. 3-4, pp. 305346.10.3233/COM-180219CrossRefGoogle Scholar
Harrison-Trainor, M., The Gamma question for many-one degrees . Annals of Pure and Applied Logic , vol. 168 (2017), no. 7, pp. 13961405.CrossRefGoogle Scholar
Hirschfeldt, D., Jockusch, C., McNicholl, T., and Schupp, P., Asymptotic density and the coarse computability bound . Computability , vol. 5 (2016), no. 1, pp. 1327.CrossRefGoogle Scholar
Jockusch, C. Jr., Degrees of functions with no fixed points, Logic, Methodology, and Philosophy of Science VIII (Fenstad, J. E., Frolov, I. T., and Hilpinen, R., editors), North-Holland, Amsterdam, pp. 191201.Google Scholar
Kamo, S. and Osuga, N., Many different covering numbers of Yorioka’s ideals . Archive for Mathematical Logic , vol. 53 (2014), no. 1-2, pp. 4356.Google Scholar
Khan, M. and Miller, J., Forcing with bushy trees . The Bulletin of Symbolic Logic , vol. 23 (2017), no. 2, pp. 160180.CrossRefGoogle Scholar
Kjos-Hanssen, B., Merkle, W., and Stephan, F., Kolmogorov complexity and the recursion theorem . Transactions of the American Mathematical Society , vol. 363 (2011), no. 10, pp. 54655480.CrossRefGoogle Scholar
Kurtz, S., Randomness and genericity in the degrees of unsolvability , Ph.D. dissertation, University of Illinois, Urbana, 1981.Google Scholar
Monin, B. and Nies, A., A unifying approach to the Gamma question, Proceedings of Logic in Computer Science (LICS) , IEEE Press, Washington, DC, 2015, pp. 585596.Google Scholar
Monin, B. and Nies, A., Muchnik Degrees and Cardinal Characteristics , preprint, 2017, arXiv:1712.00864 [math.LO].Google Scholar
Monin, B., An answer to the gamma question, Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Association for Computing Machinery, New York, 2018, pp. 730738.CrossRefGoogle Scholar
Nies, A., Computability and Randomness, Oxford Logic Guides, vol. 51, Oxford University Press, Oxford, 2009.CrossRefGoogle Scholar
Nies, A., Lowness, randomness, and computable analysis, Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday (Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., and Rosamond, F., editors), Springer, Cham, 2017, pp. 738754.Google Scholar
Rupprecht, N., Effective correspondents to cardinal characteristics in Cichoń’s diagram, Ph.D. thesis, University of Michigan, 2010.Google Scholar
Rupprecht, N., Relativized Schnorr tests with universal behavior. Archive for Mathematical Logic, vol. 49 (2010), no. 5, pp. 555570.CrossRefGoogle Scholar