Effective randomness of unions and intersections

DOI10.1007/S00224-012-9416-1zbMath1261.68076OpenAlexW1965769378MaRDI QIDQ1946502

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

computabilityrandomnesscomputable analysisBernoulli measureMartin-Löf random sets

Mathematics Subject Classification ID

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

Related Items (1)

The Intersection of Algorithmically Random Closed Sets and Effective Dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Martin-Löf randomness and Galton-Watson processes
• Effectively closed sets and graphs of computable real functions.
• Algorithmic Randomness and Capacity of Closed Sets
• Von Mises' definition of random sequences reconsidered
• Algorithmic Randomness of Closed Sets
• The definition of random sequences
• Logical Approaches to Computational Barriers

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