Skip to main content Accessibility help
×
Home

ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY

  • LAURENT BIENVENU (a1) and CHRISTOPHER P. PORTER (a2)

Abstract

In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every 2-random sequence forms a minimal pair in the Turing degrees with every 2-generic sequence (as shown by Nies, Stephan, and Terwijn). We strengthen these results by showing that every Demuth random sequence computes a 1-generic sequence and that every Demuth random sequence forms a minimal pair with every pb-generic sequence (where pb-genericity is an effective notion of genericity that is strictly between 1-genericity and 2-genericity). Moreover, we prove that for every comeager ${\cal G} \subseteq {2^\omega }$ , there is some weakly 2-random sequence X that computes some $Y \in {\cal G}$ , a result that allows us to provide a fairly complete classification as to how various notions of effective randomness interact in the Turing degrees with various notions of effective genericity.

Copyright

References

Hide All
[1]Andrews, U., Gerdes, P., and Miller, J. S., The degrees of bi-hyperhyperimmune sets. Annals of Pure and Applied Logic, vol. 165 (2014), no. 3, pp. 803811.10.1016/j.apal.2013.10.004
[2]Barmpalias, G., Day, A., and Lewis-Pye, A., The typical Turing degree. Proceedings of the London Mathematical Society, vol. 109 (2013), no. 1, pp. 139.10.1112/plms/pdt065
[3]Barmpalias, G., Downey, R., and Ng, K. M., Jump inversions inside effectively closed sets and applications to randomness, this Journal, vol. 76 (2011), no. 2, pp. 491518.
[4]Bienvenu, L., Downey, R., Greenberg, N., Nies, A., and Turetsky, D., Characterizing lowness for Demuth randomness, this Journal, vol. 79 (2014), no. 2, pp. 526560.
[5]Bienvenu, L. and Patey, L., Diagonally non-computable functions and fireworks. Information and Computation, vol. 253 (2017), pp. 6477.10.1016/j.ic.2016.12.008
[6]Demuth, O., On some classes of arithmetical real numbers. Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), pp. 453465.
[7]Demuth, O., Remarks on the structure of tt-degrees based on constructive measure theory. Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), no. 2, pp. 233247.
[8]Downey, R. and Hirschfeldt, D., Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer-Verlag, New York, 2010.10.1007/978-0-387-68441-3
[9]Downey, R., Jockusch, C., and Stob, M., Array nonrecursive degrees and genericity, Computability, Enumerability, Unsolvability. Directions in Recursion Theory (Cooper, S. B., Slaman, T. A., and Wainer, S. S., editors), London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, 1996, pp. 93104.10.1017/CBO9780511629167.005
[10]Downey, R. and Ng, K. M., Lowness for Demuth randomness, Conference on Computability in Europe (CiE 2009), Lecture Notes in Computer Science, vol. 5635, Springer-Verlag, Berlin, 2009, pp. 154166.
[11]Franklin, J. N. Y. and Ng, K. M., Difference randomness. Proceedings of the American Mathematical Society, vol. 139 (2011), pp. 345360.10.1090/S0002-9939-2010-10513-0
[12]Franklin, J. N. Y. and Ng, K. M., ω-change randomness and weak Demuth randomness, this Journal, vol. 79 (2014), no. 3, pp. 776791.
[13]Greenberg, N. and Turetsky, D., Strong jump-traceability and Demuth randomness. Proceedings of the London Mathematical Society, vol. 108 (2014), pp. 738779.10.1112/plms/pdt040
[14]Kautz, S. M., Degrees of random sequences, Ph.D. thesis, Cornell University, 1991.
[15]Kučera, A., Measure, ${\rm{\Pi }}_1^0$ classes, and complete extensions of PA. Lecture Notes in Mathematics, vol. 1141 (1985), pp. 245259.10.1007/BFb0076224
[16]Kucera, A. and Nies, A., Demuth randomness and computational complexity. Annals of Pure and Applied Logic, vol. 162 (2011), no. 7, pp. 504513.10.1016/j.apal.2011.01.004
[17]Kurtz, S., Randomness and Genericity in the Degrees of Unsolvability, Ph.D. dissertation, University of Illinois at Urbana, 1981.
[18]Nies, A., Computability and Randomness, Oxford Logic Guides, Oxford University Press, Oxford, 2009.10.1093/acprof:oso/9780199230761.001.0001
[19]Nies, A., Stephan, F., and Terwijn, S., Randomness, relativization and Turing degrees, this Journal, vol. 70 (2005), pp. 515535.
[20]Rumyantsev, A. Y. and Shen, A., Probabilistic constructions of computable objects and a computable version of Lovász local lemma. Fundamenta Informaticae, vol. 132 (2014), no. 1, pp. 114.
[21]Yates, C. E. M., Initial segments of the degrees of unsolvability part II: Minimal degrees, this Journal, vol. 35 (1970), no. 2, pp. 243266.

Keywords

ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY

  • LAURENT BIENVENU (a1) and CHRISTOPHER P. PORTER (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.