KL-randomness and effective dimension under strong reducibility

DOI10.1007/978-3-030-80049-9_45MaRDI QIDQ2117810zbMATH OpenOpenAlexFDO

Authors Bjørn Kjos-Hanssen, David J. Webb

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)

Cites work

• scientific article; zbMATH DE number 3715539 (Why is no real title available?)
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Algorithmic randomness and complexity.
• Computability and Randomness
• Dimension 1 sequences are close to randoms
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Kolmogorov-Loveland randomness and stochasticity
• Randomness extraction and asymptotic Hamming distance
• Randomness, relativization and Turing degrees

Cited in

(2)

• KL-randomness and effective dimension under strong reducibility
• Strong Medvedev reducibilities and the KL-randomness problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117810)