A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS

DOI10.1142/S0219061311000980zbMath1258.03051arXiv1408.1967MaRDI QIDQ3094357

Bjørn Kjos-Hanssen

Publication date: 24 October 2011

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

strong lawinfinite subsetsGalton-Watson processextinction criterionrandom sets of integerscomputational strength

Mathematics Subject Classification ID

Combinatorial probability (60C05) Algorithmic randomness and dimension (03D32)

Related Items (2)

Extracting randomness within a subset is hard ⋮ Cone avoiding closed sets

Cites Work

• Stable Ramsey's theorem and measure
• Infinite subsets of random sets of integers
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Lowness for Kurtz randomness
• A fixed-point-free minimal degree
• Comparing DNR and WWKL
• Computability and Randomness
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS