paper

Strong Medvedev reducibilities and the KL-randomness problem

arXiv:2204.13297

Abstract

While it is not known whether each real that is Kolmogorov-Loveland random is Martin-Löf random, i.e., whether , Kjos-Hanssen and Webb (2021) showed that is truth-table Medvedev reducible () to . They did this by studying a natural class Either(MLR) and showing that . 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.

Strong Medvedev reducibilities and the KL-randomness problem · wovepaper