Effective randomness of unions and intersections

DOI10.1007/S00224-012-9416-1MaRDI QIDQ1946502zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Rebecca Weber

Publication date 15 April 2013

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-012-9416-1

zbMATH Keywords

Bernoulli measurecomputable analysisrandomnesscomputabilityMartin-Löf random sets

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Recommendations

• Logical Approaches to Computational Barriers
• Algorithmic Randomness of Closed Sets
• scientific article; zbMATH DE number 4128138
• The Intersection of Algorithmically Random Closed Sets and Effective Dimension
• Martin-Löf randomness in spaces of closed sets

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• Algorithmic Randomness of Closed Sets
• Algorithmic randomness and capacity of closed sets
• Computability and randomness
• Effectively closed sets and graphs of computable real functions.
• Logical Approaches to Computational Barriers
• Martin-Löf randomness and Galton-Watson processes
• The definition of random sequences
• Von Mises' definition of random sequences reconsidered

Cited in

(3)

• Energy randomness
• Complementary Lipschitz continuity results for the distribution of intersections or unions of independent random sets in finite discrete spaces
• The Intersection of Algorithmically Random Closed Sets and Effective Dimension

This page was built for publication: Effective randomness of unions and intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946502)