Growth and irreducibility in path-incompressible trees
share
We study effective randomness-preserving transformations of path-incompressible trees. There exists a path-incompressible tree with infinitely many paths, which does not compute any perfect pathwise-random tree. Sparse perfect path-incompressible trees can be effectively densified, almost surely. We characterize the density of branching that pathwise-random trees can have.
READ FULL TEXT