Abstract
We investigate the μ-randomness of unions and intersections of random sets under various notions of randomness corresponding to different probability measures. For example, the union of two relatively Martin-Löf random sets is not Martin-Löf random but is random with respect to the Bernoulli measure \(\lambda_{\frac{3}{4}}\) under which any number belongs to the set with probability \(\frac{3}{4}\). Conversely, any \(\lambda_{\frac{3}{4}}\) random set is the union of two Martin-Löf random sets. Unions and intersections of random closed sets are also studied.
Similar content being viewed by others
References
Brodhead, B.C.P., Cenzer, D., Dashti, S.: Random closed sets. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) Logical Approaches to Computational Barriers. Lecture Notes in Computer Science, vol. 3988, pp. 55–64. Springer, Berlin (2006)
Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., Weber, R.: Algorithmic randomness of closed sets. J. Log. Comput. 17, 1041–1062 (2007)
Brodhead, P., Cenzer, D., Toska, F., Wyman, S.: Algorithmic randomness and capacity of closed sets. Log. Methods Comput. Sci. 7(3), 1–16 (2011)
Cenzer, C.D., Remmel, J.B.: Effectively Closed Sets. Book Manuscript (2013, to appear)
Cenzer, D., Remmel, J.B.: \(\varPi^{0}_{1}\) classes. In: Ersov, Y., Goncharov, S., Marek, V., Nerode, A., Remmel, J. (eds.) Handbook of Recursive Mathematics. Vol. 2. Recursive Algebra, Analysis and Combinatorics. Elsevier Studies in Logic and the Foundations of Mathematics, vol. 139, pp. 623–821 (1998)
Diamondstone, D., Kjos-Hanssen, B.: Martin-Löf randomness and Galton-Walton processes. Ann. Pure Appl. Log. 163, 519–529 (2012)
Martin-Löf, M.L.P.: The definition of random sequences. Inf. Control 9, 602–619 (1966)
Nies, N.A.: Computability and Randomness. Oxford University Press, Oxford (2009)
Soare, S.R.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)
van Lambalgen, v.M.: Random sequences. Ph.D. Dissertation, University of Amsterdam (1987)
von Mises, R.: Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z. 5, 52–99 (1919)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research was partially supported by the National Science Foundation grants DMS 0532644 and 0554841 and 0062393. Thanks also to the American Institute of Mathematics for support during 2006 Effective Randomness Workshop.
Rights and permissions
About this article
Cite this article
Cenzer, D., Weber, R. Effective Randomness of Unions and Intersections. Theory Comput Syst 52, 48–64 (2013). https://doi.org/10.1007/s00224-012-9416-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-012-9416-1