KL-randomness and effective dimension under strong reducibility
Logic
2021-04-30 v2
Abstract
We show that the (truth-table) Medvedev degree KLR of Kolmogorov--Loveland randomness coincides with that of Martin L\"of 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.
Cite
@article{arxiv.2104.13511,
title = {KL-randomness and effective dimension under strong reducibility},
author = {Bjørn Kjos-Hanssen and David J. Webb},
journal= {arXiv preprint arXiv:2104.13511},
year = {2021}
}