Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.32522

On the complexity of Medvedev reducibility

Remi Pallen
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Medvedev lattice is a tool used to classify the complexity of effective closed sets. In this article, we are interested in the complexity of using this tool. In particular, we study the complexity of deciding whether two effective closed sets have the same degree, when one is fixed and the other is given as input. This problem is naturally~$Σ^0_3$, and among other results, we show that for all degrees except the maximal one, the problem reaches its maximal complexity. It turns out that the argument is not uniform and depends on the self-similarity of the fixed degree, a notion that we introduce in this article. The complexity of having maximal degree is particularly difficult to establish, but we obtain a lower bound that almost matches the upper bound. We also show that deciding whether an effective closed set has a degree incomparable with a fixed degree $d$ is $Π^0_3$-complete whenever $\mathbf{0}_s <_s d <_s \mathbf{1}_s$.

Explore related subjects

math.LOcs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Remi Pallen. 2026-10-23. On the complexity of Medvedev reducibility. https://arxiv.org/abs/2610.32522

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

KEEP EXPLORING

Related papers

arXiv2026

Adversarial Problems and the Limits of Uniform Resolution

A general method of resolution can take part in forming problems once their language represents the method itself. A fixed formation rule gives each sound resolver a presentation it cannot answer. Admitting the diagnosis yields a sound successor with an instance of its own. For standard arithmetical theories $\mathrm{T}$, the instance is $\mathsf{HA}$-provably equivalent to $\mathrm{Con}(\mathrm{T})$. A theory that decides its own instance asserts a false sentence. The $m$-th iterated independence question is equivalent to the instance $m$ stages later. No effective admission policy with consistent union closes the regress. A noncomputable answer function resolves all program indices, while a false assertion of resolution supplies no warrant. At feasible scale, bounded self-consistency is cheap. A clocked Gödel sentence gives an unconditional gap relative to its short binary description, but no superpolynomial lower bound in the window size. The arithmetic identity motivates studying bounded consistency of the successor theory, as in a conjecture of Pudlák. We state its finitely axiomatized case and prove that it implies $\mathcal{NP}\ne\mathrm{co}\mathcal{NP}$. The conjecture motivates a feasible analogue, but does not establish all clauses of the unbounded barrier.

math.LO↗
arXiv2026

The universal measure of nonstochastic objects

The usual settings for discussing the notion of stochastic objects are very different from Kolmogorov's original structure-free setting, in which there is no predefined external structure on the objects (such as the lengths of binary strings). A natural modification of stochasticity, obtained by replacing finite sets as models with probability measures, is quasi-stochasticity. The structure-free setting is common in studies of quasi-stochasticity, and known results show that the universal machine generates non-quasi-stochastic objects with exponentially small probability. This paper shows that, on the other hand, the universal machine generates nonstochastic objects surprisingly often. It also systematically explores numerous connections between stochasticity and quasi-stochasticity in the structure-free setting. In particular, the definition of quasi-stochasticity can be modified in a natural way modelled on Kolmogorov's definition so that non-quasi-stochastic objects are produced as often as nonstochastic ones; the results for this modification imply all the results of this paper showing that nonstochastic objects are frequent.

math.LO↗
arXiv2026

Amenable subrelations of treeable equivalence relations and applications to anti-treeability

We study the structure of amenable subrelations of treeable measure-class-preserving equivalence relations, applying the Radon--Nikodym topography perspective initiated in our companion paper [TTD25]. For a nowhere smooth amenable subrelation, we show that the ends selected by each class in Adams's end selection theorem are precisely those which are nonvanishing along that class. From this, we derive a number of structure results about nowhere smooth amenable subrelations of treeable equivalence relations. For example, we show that every nowhere smooth amenable subrelation is contained in an essentially unique maximal amenable subrelation. This yields an anti-treeability criterion, which we use to show that every nonamenable locally compact second countable group with noncompact amenable radical is not treeable, and that every nonamenable nonunimodular treeable group has a compact open subgroup.

math.LO↗