Pages that link to "Item:Q285520"
From MaRDI portal
The following pages link to Relating and contrasting plain and prefix Kolmogorov complexity (Q285520):
Displaying 6 items.
- Not every domain of a plain decompressor contains the domain of a prefix-free one (Q620966) (← links)
- An additivity theorem for plain Kolmogorov complexity (Q1946492) (← links)
- On the gap between trivial and nontrivial initial segment prefix-free complexity (Q1946508) (← links)
- Randomness and initial segment complexity for measures (Q2062126) (← links)
- The frequent paucity of trivial strings (Q2252648) (← links)
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity (Q2921012) (← links)