paper

KL-randomness and effective dimension under strong reducibility

arXiv:2104.13511

Abstract

We show that the (truth-table) Medvedev degree KLR of Kolmogorov--Loveland randomness coincides with that of Martin Löf randomness, MLR, answering a question of Miyabe. Next, an analogue of complex packing dimension is studied which gives rise to a set of weak truth-table Medvedev degrees isomorphic to the Turing degrees.

KL-randomness and effective dimension under strong reducibility · wovepaper