Limit Complexities and Relativization

• Limit complexities and relativization are analytical processes that examine the asymptotic behavior of complexity measures using limit operators, reflecting the impact of Turing jump oracles.
• They employ techniques such as the constructive Fatou lemma and increase-and-trim procedure to link effective measure theory with algorithmic randomness.
• Relativization translates quantified limit behavior into successive Turing jumps, establishing a correspondence with the arithmetical hierarchy and influencing proof complexity.

Limit complexities refer to the asymptotic behaviors of Kolmogorov complexity and related algorithmic invariants under various limit operations—primarily $\limsup$ and $\liminf$—and their close connection to the arithmetical hierarchy via relativization to Turing jump oracles. The systematic study of limit complexities and their relativized forms reveals precise correspondences between the complexity of descriptions available with auxiliary information and the quantifier complexity of their definitions. These limit operators play a central role in algorithmic information theory, randomness, and the fine structure of complexity classes, reaching from foundational results in effective measure theory to structural separations in proof complexity.

1. Foundations: Limit Complexities and Relativization

The plain Kolmogorov complexity $C(x)$ of a binary string $x$ is the length of the shortest program that outputs $x$ on a fixed universal Turing machine. Its relativized variant $C^A(x)$ gives the same definition, but the reference machine is equipped with oracle $A$.

For conditional complexity, $C(x|n)$ denotes the minimum program length producing $x$ with access to the integer $n$ as auxiliary input. Relativization to the halting problem, or the $\liminf$0 oracle, yields $\liminf$1, measuring the complexity of $\liminf$2 given access to a complete c.e. set.

Limit complexities then consider the asymptotics of conditional or oracle-based complexities, for example: $\liminf$3 where $\liminf$4 denotes prefix complexity, and $\liminf$5 seeks the eventual supremum along the sequence of complexities as $\liminf$6 increases.

A key meta-principle is that, up to additive $\liminf$7 constants, each use of a quantifier in the limit operation is mirrored by one Turing jump in the oracle, so that

$\liminf$8

and analogously for other variants (0802.2833, Bienvenu et al., 2012, Downey et al., 2022, 0801.0349).

2. Main Limit Complexity Results

2.1. Vereshchagin’s Theorem

For all strings $\liminf$9,

$C(x)$0

This bidirectional equality is robust: If $C(x)$1, then for large $C(x)$2 the $C(x)$3-relative computation can be simulated by feeding the relevant finite part of the oracle, computable from $C(x)$4, into $C(x)$5. Conversely, if the limsup is small, a finite construction using a search with $C(x)$6 recovers a short program for $C(x)$7 relative to $C(x)$8 (0802.2833, Bienvenu et al., 2012).

2.2. Analogs for Prefix Complexity and Semimeasures

The same principle applies to prefix complexity and a priori probabilities: $C(x)$9 where $x$0 is tree-a priori complexity. Again, all proofs are uniform in the complexity under consideration (Bienvenu et al., 2012).

2.3. Limit Frequencies and Semimeasures

For any (even partial) computable function $x$1, the empirical "limit frequency"

$x$2

is always dominated by a lower $x$3-semicomputable semimeasure. Every such semimeasure is, up to constant factor, realized for some total $x$4 (0802.2833, Bienvenu et al., 2012). This constitutes a completeness-type universality result for lower $x$5-semicomputable semimeasures in the context of limit frequencies.

3. Effectively Open Sets and Constructive Fatou’s Lemma

A sequence $x$6 of effectively open subsets of Cantor space $x$7 with $x$8 exhibits the classical property $x$9 for Lebesgue measure $x$0. Effectively, for any $x$1, there exists a $x$2-effectively open set $x$3 of measure $x$4 such that

$x$5

This sharp constructive Fatou lemma, due to Conidis and refined in (Bienvenu et al., 2012), underlies modern effective measure theory and is proven via an "increase-and-trim" procedure: for each basic open set, attempt to add it to $x$6 for all large $x$7 (using $x$8 to respect the global measure constraint), trimming as needed.

The effective liminf construction has extensive applications in randomness, a priori probability, and is central to the translation of measure-theoretic arguments into computable analysis (0802.2833, Bienvenu et al., 2012).

4. Relativization and the Jump/Limit Hierarchy

Relativization systematically lifts these results: for any oracle $x$9,

$C^A(x)$0

and for $C^A(x)$1 Turing jumps,

$C^A(x)$2

This correspondence extends to prefix complexity $C^A(x)$3 and further higher-level hierarchies, and has been notably explored in (Downey et al., 2022), which gives explicit, nested $C^A(x)$4 characterizations: $C^A(x)$5 The jump/limit principle resonates across representations of integers (Church, cardinal, ordinal) in algorithmic structures, where effectivizing the abstraction aligns the induced Kolmogorov complexity exactly with the corresponding jump in oracle power (0801.0349).

5. Characterizations of Higher Randomness

Limit complexity theorems give new characterizations of algorithmic randomness at higher levels. For 2-randomness (Martin-Löf randomness relative to $C^A(x)$6), Miller’s theorem asserts equivalence among the following conditions for an infinite binary sequence $C^A(x)$7:

• $C^A(x)$8 is 2-random,
• there exists $C^A(x)$9 such that every prefix $A$0 can be extended to $A$1 with $A$2,
• there exists $A$3 such that for infinitely many prefixes $A$4 of $A$5, $A$6 (0802.2833, Bienvenu et al., 2012).

These extend, via the nested $A$7 formula, to all "n-randomness" levels: a real $A$8 is $A$9-random iff for some $C(x|n)$0, for all large $C(x|n)$1,

$C(x|n)$2

(Downey et al., 2022). This places higher randomness notions entirely within the orbit of unrelativized $C(x|n)$3, illuminated by the structure of limit complexities.

6. Methodological Innovations and Proof Techniques

The main combinatorial insight enabling all these results is the "increase-and-trim" (constructive Fatou) method: operations to raise the complexity or measure along tails of a sequence, subject to global constraints checked via access to $C(x|n)$4. This replaces earlier methods (notably the Low Basis Theorem) and yields uniform, transparent proofs across complexity, measure, and semimeasure settings (Bienvenu et al., 2012).

This method generalizes to tree structures (for $C(x|n)$5), semimeasures, and even non-numeric invariants, highlighting a deep alignment between effective compactness and hierarchy via the Turing jump.

7. Broader Implications across Complexity and Proof Theory

Limit complexity analysis establishes the essential interplay between quantifier complexity and oracle power—effectively, limit behavior replaces universal effectivity by one higher Turing jump. This insight permeates:

• Fine structure in Kolmogorov complexity and randomness,
• The classification of semimeasures and their universality,
• The effective measure-theoretic analysis of open sets in Cantor space,
• The alignment of effectivized classical set-theoretic representations of integers to the jump/limit hierarchy (0801.0349),
• The structural behavior of small complexity classes and relativizations (Aehlig et al., 2012),
• The analysis of proof complexity, where relativization induces exponential blow-ups in resolution and bounded-conjunction systems and separates levels of proof systems via explicitly constructed oracles (Dantchev et al., 2013).

These results comprise a central theme in higher recursion theory, algorithmic randomness, and the landscape of effective descriptive set theory.