KL-randomness and effective dimension under strong reducibility
From MaRDI portal
Publication:6366309
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.
This page was built for publication: KL-randomness and effective dimension under strong reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366309)
