Strong Medvedev reducibilities and the KL-randomness problem
Abstract
While it is not known whether each real that is Kolmogorov-Loveland random is Martin-L\"of random, i.e., whether KLR⊂eqMLR, Kjos-Hanssen and Webb (2021) showed that MLR is truth-table Medvedev reducible (s,tt) to KLR. They did this by studying a natural class Either(MLR) and showing that MLRs,ttEither(MLR)⊃eqKLR. We show that Degtev's stronger reducibilities (positive and linear) do not suffice for the reduction of MLR to Either(MLR), and some related results.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.