Gales and the Constructive Dimension of Individual Sequences
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Algorithmic Randomness of Closed Sets *
Journal of Logic and Computation
Effective dimension of points visited by Brownian motion
Theoretical Computer Science
Algorithmically random closed sets and probability
Algorithmically random closed sets and probability
Hi-index | 0.00 |
The members of Martin-Löf random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-Löf random Galton-Watson trees with survival parameter $\frac{2}{3}$. To be such a member, a sufficient condition is to have effective Hausdorff dimension strictly greater than $\gamma=\log_2 \frac{3}{2}$, and a necessary condition is to have effective Hausdorff dimension greater than or equal to *** .