Pages that link to "Item:Q5958287"
From MaRDI portal
The following pages link to Independent minimum length programs to translate between given strings (Q5958287):
Displaying 8 items.
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Nonapproximability of the normalized information distance (Q716306) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- INFORMATION DISTANCE AND ITS APPLICATIONS (Q3503084) (← links)
- On Generating Independent Random Strings (Q3576088) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)
- Conditional complexity and codes (Q5958284) (← links)
