Skip to main content
Log in

Effective Randomness of Unions and Intersections

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. 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)

    Chapter  Google Scholar 

  2. Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., Weber, R.: Algorithmic randomness of closed sets. J. Log. Comput. 17, 1041–1062 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brodhead, P., Cenzer, D., Toska, F., Wyman, S.: Algorithmic randomness and capacity of closed sets. Log. Methods Comput. Sci. 7(3), 1–16 (2011)

    MathSciNet  Google Scholar 

  4. Cenzer, C.D., Remmel, J.B.: Effectively Closed Sets. Book Manuscript (2013, to appear)

  5. 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)

    Chapter  Google Scholar 

  6. Diamondstone, D., Kjos-Hanssen, B.: Martin-Löf randomness and Galton-Walton processes. Ann. Pure Appl. Log. 163, 519–529 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Martin-Löf, M.L.P.: The definition of random sequences. Inf. Control 9, 602–619 (1966)

    Article  Google Scholar 

  8. Nies, N.A.: Computability and Randomness. Oxford University Press, Oxford (2009)

    Book  MATH  Google Scholar 

  9. Soare, S.R.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)

    Google Scholar 

  10. van Lambalgen, v.M.: Random sequences. Ph.D. Dissertation, University of Amsterdam (1987)

  11. von Mises, R.: Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z. 5, 52–99 (1919)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Douglas Cenzer.

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

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-012-9416-1

Keywords

Navigation