Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.13585

How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?

Tomislav Petrović
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

cs.CCcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomislav Petrović. 2026-10-09. How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?. https://arxiv.org/abs/2610.13585

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the Limits of Quantum Multiparty Simultaneous Communication

We study the relative power of public randomness and quantum communication in the multiparty Simultaneous Message Passing (SMP) model. By analyzing a total Boolean function and a relational problem, we establish polynomial and exponential separations between classical public-coin protocols and quantum protocols without shared randomness or prior entanglement. We first introduce XOR Equality, a total Boolean function in which each of $k$ players receives an unrestricted string $x_j\in\{0,1\}^n$, and the referee must decide whether $x_1\oplus\cdots\oplus x_k=0^n$. For $k\ge8$ and worst-case error at most $1/3$, we prove quantum lower bounds of $Ω(\min\{n,k^2\})$ on total communication and $Ω(\min\{n/k,k\})$ on maximum message length. A classical public-coin protocol uses two bits per player with error at most $1/4$. For $n=k^2$ and worst-case error at most $1/3$, we prove that quantum protocols require maximum message length $Ω(\sqrt n)$ qubits, whereas two public-coin bits per player suffice. We then turn to relations, for which we obtain exponential separations. Specifically, we study Multiparty Index Coordination, a $k$-player generalization of the two-player relation studied by Gavinsky, Kempe, Regev, and de Wolf (STOC 2006). We prove an unambiguous quantum lower bound of $Ω(n^{1-1/k})$ on maximum message length, matched by a classical private-coin protocol. For any fixed error $\varepsilon\in(0,1/8)$, we also prove a bounded-error quantum lower bound of $Ω(n^{(k-1)/(k+1)})$ while we show that public-coin protocols solve the relation unambiguously with maximum message length $O(\log n)$, giving exponential separations in both regimes. The implicit constants are independent of $k$, and both quantum lower bounds become linear when $k\ge c\log n$ for any fixed $c>0$.

cs.CC↗
arXiv2026

Near-Linear Regimes for One-Sided Distribution-Free Junta Testing

We study adaptive one-sided distribution-free testing of Boolean $k$-juntas, with membership-query access to the function and sample access to an arbitrary unknown distribution. For general Boolean functions, we give a tester using $O(k^2\log(k+1)+k/ε)$ queries, independently of the ambient dimension. The tester maintains disjoint relevant blocks certified by observed disagreements. Within each fresh batch, it jointly decodes literal signatures for a small family of random base masks, then uses linear combinations to generate $Θ(1/ε)$ probes. Their ideal counterparts are pairwise independent, yielding constant conditional progress probability; a global $O(k)$ batch budget gives the additive query bound. Consequently, the complexity is $O((k/ε)\log(k+1))$ when $ε\le1/k$, and $O(k/ε)$ when $ε\le1/(k\log(k+1))$. We also analyze an indexed-table implementation that reuses previously computed block orientations. For functions symmetric on an unknown set of relevant variables, it uses $O(k\log^2(k+1)/ε)$ queries: safely checked blocks contain a single globally relevant variable, making their cached nonliteral sides reusable. For arbitrary functions, a stable-deletion analysis establishes soundness of the same implementation at $O(k^2\log(k+1)/ε)$ queries. All variants always accept $k$-juntas, and every rejection is certified by $k+1$ disjoint relevant blocks. The fresh-batch construction and the reuse analysis use the same certified-block framework, with different randomness and stopping rules.

cs.CC↗
arXiv2026

A Relative-Computability Theory of Self-Improving Agents

Agents increasingly modify the procedures by which they solve tasks and improve themselves. Autonomy over improvement, gains in practical capability, and enlargement of computational reach are distinct properties. We develop an oracle-relative model with mutable solvers, evaluators, and improvers. Uniform simulation keeps every total decision procedure produced by effective self-revision over $A$ within $\mathcal{C}(A)=\{D:D\leq_T A\}$; oracle joins account for additional access, while the relativized limit lemma separates limiting answers from effective completion. A worked model of Boolean rule acquisition makes the distinction constructive. For a known finite-dimensional feature language, we characterize exactly which answers a query history determines, obtain a sharp teacher-query bound, and give a terminating protocol that permits revisions to the query proposer. The learned solver can dispense with the teacher on every input while remaining in the same computability layer. However, uniformly constructing the required feature-span specification from arbitrary effective feature programs is already as hard as the relative halting problem. We also give a conditional criterion for strict ascent and distinguish it from finite behavioral evidence. The framework thus separates acquisition, certification, and computability ascent, identifying both a positive route to verified support removal and the assumptions on which it depends.

cs.CC↗