KL-randomness and effective dimension under strong reducibility

DOI10.1007/978-3-030-80049-9_45OpenAlexW3185329645MaRDI QIDQ2117810

David J. Webb, Bjørn Kjos-Hanssen

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2104.13511

zbMATH Keywords

effective dimensionalgorithmic randomnessMedvedev reducibility

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Strong Medvedev reducibilities and the KL-randomness problem

Cites Work

• Unnamed Item
• Dimension 1 sequences are close to randoms
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Kolmogorov-Loveland randomness and stochasticity
• Randomness extraction and asymptotic Hamming distance
• Algorithmic Randomness and Complexity
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Computability and Randomness
• Randomness, relativization and Turing degrees

This page was built for publication: KL-randomness and effective dimension under strong reducibility