The Intersection of Algorithmically Random Closed Sets and Effective Dimension
From MaRDI portal
Publication:5056370
DOI10.1145/3545114zbMath1505.03088arXiv2103.03965OpenAlexW3135361590MaRDI QIDQ5056370
Christopher P. Porter, Adam Case
Publication date: 8 December 2022
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.03965
computability theoryeffective dimensionalgorithmic randomnessGalton-Watson processesrandom closed sets
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Algorithmic randomness and dimension (03D32)
Cites Work
- Unnamed Item
- Martin-Löf randomness and Galton-Watson processes
- Correspondence principles for effective dimensions
- Layerwise computability and image randomness
- Martin-Löf random generalized Poisson processes
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- The dimensions of individual strings and sequences
- Effective randomness of unions and intersections
- Turing Computability
- Algorithmic Randomness and Complexity
- Algorithmic Randomness and Capacity of Closed Sets
- The interplay of classes of algorithmically random objects
- An Application of Martin-Löf Randomness to Effective Probability Theory
- Applications of Effective Probability Theory to Martin-Löf Randomness
- Kolmogorov Complexity and Algorithmic Randomness
- Algorithmic Randomness
- Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
- The axiomatization of randomness
- Algorithmic Randomness of Closed Sets
- MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: The Intersection of Algorithmically Random Closed Sets and Effective Dimension
