KL-randomness and effective dimension understrong reducibility

arxiv（2021）

引用 1|浏览2

暂无评分

摘要

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.

查看译文

关键词

Algorithmic randomness, Effective dimension, Medvedev reducibility

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要