Growth and irreducibility in path-incompressible trees
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909067245518848 |
|---|---|
| author | Barmpalias, George Zhang, Xiaoyan |
| author_facet | Barmpalias, George Zhang, Xiaoyan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2206_15425 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Growth and irreducibility in path-incompressible trees Barmpalias, George Zhang, Xiaoyan Combinatorics Information Theory Logic 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. |
| title | Growth and irreducibility in path-incompressible trees |
| topic | Combinatorics Information Theory Logic |
| url | https://arxiv.org/abs/2206.15425 |