KL-randomness and effective dimension under strong reducibility

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

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

• Algorithmic randomness and complexity.
• Kolmogorov-Loveland randomness and stochasticity
• Title not available (Why is that?)
• Computability and Randomness
• Randomness, relativization and Turing degrees
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Dimension 1 sequences are close to randoms
• Randomness extraction and asymptotic Hamming distance

Cited In (2)

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

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)