{
  "abstract": "We'll call a map from basic to clopen sets of binary sequences an \\textit{encoding} if it preserves uniform Lebesgue measure and the disjointedness relation. For some notion of randomness $R$ we can ask if there is a computable encoding $E$ such that for every non-Martin-Löf-random (non-MLR) sequence $α$, the sequences in $E(α)$ are non-$R$. Thus we can use $E$ and randomness test for $R$ to construct a randomness test for MLR. We show that there is no such $E$ for partial computable randomness (PCR), but there is one for Kolmogorov-Loveland randomness. Indeed, there is a total computable $E$ and a pair of total computable non-monotonic betting strategies such that on every sequence in $E(α)$ at least one of the strategies wins whenever $α$ is non-MLR.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.13585",
  "author_total": 1,
  "authors": [
    {
      "name": "Tomislav Petrović"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/6v1bgexs8x6z1.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.13585",
  "fulltext_url": null,
  "id": "6v1bgexs8x6z1",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.13585",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CC"
    ],
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1703|Computability, Logic, AI Algorithms"
    ]
  ],
  "openalex": "W7221545097",
  "pdf_url": "https://arxiv.org/pdf/2610.13585",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-09",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/6v1bgexs8x6z1.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:28:40Z",
      "native_id": "2610.13585",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.13585"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?",
  "title_text": "How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?",
  "type": "preprint",
  "updated_at": "2026-10-30T12:28:40Z",
  "url": "https://research.draconitic.com/paper/6v1bgexs8x6z1",
  "venue": "arXiv",
  "versions": []
}