Strong Medvedev reducibilities and the KL-randomness problem
From MaRDI portal
Publication:2104264
DOI10.1007/978-3-031-08740-0_13OpenAlexW4285108100MaRDI QIDQ2104264FDOQ2104264
Authors: Bjørn Kjos-Hanssen, David J. Webb 
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2204.13297
Recommendations
- KL-randomness and effective dimension under strong reducibility
- Randomized versions of Mazur lemma and Krein-Šmulian theorem
- scientific article; zbMATH DE number 3995648
- Reducibilities relating to Schnorr randomness
- Coarse reducibility and algorithmic randomness
- On completeness under random reductions
- Randomization of Sharkovskii-type theorems
- Strong reductions in effective randomness
- Randomness and Solovay degrees
- Strong jump-traceability and Demuth randomness
[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Martin-L%EF%BF%BD%EF%BF%BDf+randomness&go=Go Martin-L��f randomness]truth-table reducibilityMedvedev reducibility
Cites Work
- Algorithmic randomness and complexity.
- Kolmogorov-Loveland randomness and stochasticity
- Computability and Randomness
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Title not available (Why is that?)
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- KL-randomness and effective dimension under strong reducibility
- A van Lambalgen theorem for Demuth randomness
Cited In (1)
This page was built for publication: Strong Medvedev reducibilities and the KL-randomness problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104264)
