Growth and irreducibility in path-incompressible trees
Combinatorics
2024-01-11 v4 Information Theory
math.IT
Logic
Abstract
We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect path-incompressible trees can be effectively densified, almost surely. We characterize the branching density of path-random trees.
Keywords
Cite
@article{arxiv.2206.15425,
title = {Growth and irreducibility in path-incompressible trees},
author = {George Barmpalias and Xiaoyan Zhang},
journal= {arXiv preprint arXiv:2206.15425},
year = {2024}
}
Comments
Revised