Growth and irreducibility in path-incompressible trees

DOI10.1016/j.ic.2024.105136arXiv2206.15425MaRDI QIDQ6204167

George Barmpalias, Xiaoyan Zhang

Publication date: 27 March 2024

Published in: Information and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Unnamed Item
• Unnamed Item
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• Highness properties close to PA completeness
• Denjoy, Demuth and density
• Von Neumann's Biased Coin Revisited
• Algorithmic Randomness and Complexity
• Limits of the Kučera–Gács Coding Method
• The importance of Π₁⁰ classes in effective randomness
• On the computability of perfect subsets of sets with positive measure
• DEEP CLASSES
• Theory of Random Sets
• MARTIN-LÖF RANDOMNESS IN SPACES OF CLOSED SETS
• The definition of random sequences
• Randomness, relativization and Turing degrees

This page was built for publication: Growth and irreducibility in path-incompressible trees