Abstract
We study randomness-preserving transformations of path-incompressible trees, namely trees of finite randomness deficiency. We characterize their branching density, and show: (a) sparse perfect path-incompressible trees can be effectively densified, almost surely; (b) there exists a path-incompressible tree with infinitely many paths which does not compute any perfect path-incompressible tree with computable oracle-use.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
