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. Sparse perfect path-incompressible trees can be effectively densified, almost surely. We characterize the branching density of path-random trees.

翻译：暂无翻译