Strong Medvedev reducibilities and the KL-randomness problem

preprint2022arXivOpen access

Abstract

While it is not known whether each real that is Kolmogorov-Loveland random is Martin-Löf random, i.e., whether KLR⊆MLR\mathrm{KLR}\subseteq\mathrm{MLR}, Kjos-Hanssen and Webb (2021) showed that MLR\mathrm{MLR} is truth-table Medvedev reducible (≤s,tt\le_{s,tt}) to KLR\mathrm{KLR}. They did this by studying a natural class Either(MLR) and showing that MLR≤s,ttEither(MLR)⊇KLR\mathrm{MLR}\le_{s,tt}\mathrm{Either(MLR)}\supseteq\mathrm{KLR}. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.