Strong Medvedev reducibilities and the KL-randomness problem

DOI10.1007/978-3-031-08740-0_13OpenAlexW4285108100MaRDI QIDQ2104264

Bjørn Kjos-Hanssen, David J. Webb

Publication date: 7 December 2022

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

zbMATH Keywords

Martin-Löf randomnesstruth-table reducibilityMedvedev reducibility

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• KL-randomness and effective dimension under strong reducibility
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Kolmogorov-Loveland randomness and stochasticity
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• Algorithmic Randomness and Complexity
• Computability and Randomness
• A van Lambalgen theorem for Demuth randomness

This page was built for publication: Strong Medvedev reducibilities and the KL-randomness problem