Martin-Löf randomness and Galton-Watson processes

DOI10.1016/j.apal.2011.06.010zbMath1247.03085arXiv1408.2875OpenAlexW2130722800MaRDI QIDQ764271

Bjørn Kjos-Hanssen, David E. Diamondstone

Publication date: 13 March 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2875

zbMATH Keywords

computability theoryMartin-Löf randomnessGalton-Watson processesrandom closed sets

Mathematics Subject Classification ID

Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (8)

Energy randomness ⋮ The Intersection of Algorithmically Random Closed Sets and Effective Dimension ⋮ Algorithmically Random Functions and Effective Capacities ⋮ Schnorr randomness for noncomputable measures ⋮ Layerwise computability and image randomness ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Effective randomness of unions and intersections ⋮ The random members of a \({\Pi }_{1}^{0}\) class

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and percolation on trees
• Effectively closed sets of measures and randomness
• Effective dimension of points visited by Brownian motion
• Infinite subsets of random sets of integers
• On the relation between descriptional complexity and algorithmic probability
• Martin-Löf random generalized Poisson processes
• Kolmogorov complexity and the Recursion Theorem
• Members of Random Closed Sets
• Lowness for Kurtz randomness
• Trees Generated by a Simple Branching Process
• Relations between varieties of kolmogorov complexities
• Algorithmic Randomness 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

This page was built for publication: Martin-Löf randomness and Galton-Watson processes