Effective Dense Reducibility

• Effective dense reducibility is a notion from asymptotic computability that uses total functions with a no-answer symbol to capture descriptions whose strong domain has density 1.
• It distinguishes itself from generic, coarse, and dense computability by offering both uniform and nonuniform reducibility notions, leading to unique degree structures.
• Measure-theoretic analysis and embedding techniques reveal its intricate relation with Turing degrees, minimal pair phenomena, and forcing notions in computability.

Searching arXiv for recent and foundational papers on effective dense reducibility. Effective dense reducibility is a notion from asymptotic computability that compares functions by asking whether every effective dense description of one function yields an effective dense description of another. An effective dense description is a total map into $\omega \cup \{\Box\}$ that is correct wherever it gives a value in $\omega$, and uses the special no-answer symbol $\Box$ only on a density-$0$ set; equivalently, its strong domain has density $1$. The notion was introduced together with dense reducibility in the study of dense computability, upper cones, and minimal pairs, and was later reexamined in a broader comparison between functions on $\omega^\omega$ and sets in $2^\omega$ (Astor et al., 2018, Gerdes, 9 Aug 2025).

1. Formal framework

The underlying small-set notion is asymptotic density. For $S \subseteq \omega$, writing $S \cap n = S \cap \{0,1,\dots,n-1\}$, the upper density is

$\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$

and the lower density is

$\omega$0

When the two agree, one speaks of the density of $\omega$1.

For a total function $\omega$2, a strong partial description is a total function

$\omega$3

such that $\omega$4 for all $\omega$5 in the strong domain

$\omega$6

An effective dense description of $\omega$7 is a strong partial description whose strong domain has density $\omega$8. Thus $\omega$9 is effectively densely computable if it has a computable effective dense description. The 2018 paper also gives an equivalent formulation: there is a partial computable generic description $\Box$0 with computable domain of density $\Box$1, and $\Box$2 agrees with $\Box$3 on its domain (Astor et al., 2018).

A later presentation formalizes the same idea using “Box-equality.” For $\Box$4,

$\Box$5

Then $\Box$6 is an effective dense description of $\Box$7 if $\Box$8 and the set where $\Box$9 has density $0$0; equivalently, for some density-$0$1 set $0$2, one has $0$3 (Gerdes, 9 Aug 2025).

2. Position among asymptotic computability notions

Effective dense computability sits among several asymptotic relaxations of exact computability. For a total function $0$4, the neighboring notions are:

• Generic computability: a partial description $0$5 with $0$6 whenever defined, and $0$7 of density $0$8.
• Coarse computability: a total function $0$9 such that $1$0 has density $1$1.
• Dense computability: a partial function $1$2 such that $1$3 has density $1$4.
• Effective dense computability: a strong partial description with density-$1$5 strong domain.

At the level of computability notions, the implication pattern established in the 2018 paper is: $1$6 Generic and coarse computability are incomparable, and dense computability is strictly weaker than each of them (Astor et al., 2018).

The same work introduces four asymptotic bounds: $1$7 where $1$8 is the strong partial bound and “effective dense computability” is the statement $1$9. Proposition 2.1 proves the equalities

$\omega^\omega$0

so effective dense computability is aligned quantitatively with generic computability via $\omega^\omega$1, while dense computability is aligned with coarse computability via $\omega^\omega$2 (Astor et al., 2018).

Several standard examples sharpen the distinctions. There are c.e. sets that are both generically and coarsely computable but not effectively densely computable; one example is a c.e. set of density $\omega^\omega$3 with no computable subset of density $\omega^\omega$4. There are also sets that are densely computable but neither generically nor coarsely computable. Moreover, $\omega^\omega$5 does not imply dense computability. Theorem 2.5 gives a Boolean characterization: any Boolean combination of the six properties in the paper’s implication graph is realized by a c.e. set unless it is ruled out by the implications (Astor et al., 2018).

3. Reducibility notions and the uniform/nonuniform split

The reducibility notion attached to effective dense descriptions is defined in two forms. For total functions $\omega^\omega$6:

Reducibility	Requirement	Uniformity device
$\omega^\omega$7	Every effective dense description of $\omega^\omega$8 computes an effective dense description of $\omega^\omega$9	May vary with the input description
$2^\omega$0	A single Turing functional sends every effective dense description of $2^\omega$1 to an effective dense description of $2^\omega$2	One fixed Turing functional

The contrast with dense reducibility is technically important. Because dense and generic descriptions are partial, dense reducibility is defined via enumeration operators acting on graphs of partial descriptions. Effective dense descriptions, by contrast, are total functions with an explicit no-answer symbol, so Turing functionals suffice (Astor et al., 2018).

The 2018 paper proves that the uniform and nonuniform effective dense reducibilities are genuinely different. Corollary 5.3 states that there exist sets $2^\omega$3 such that

$2^\omega$4

The construction uses a set $2^\omega$5 that is not autoreducible, such as a $2^\omega$6-random or $2^\omega$7-generic set, together with the coding map $2^\omega$8. A parallel result for dense reducibility appears in Corollary 5.8: $2^\omega$9 There the construction uses a set that is not jump-autoreducible, such as a $S \subseteq \omega$0-generic or $S \subseteq \omega$1-random set (Astor et al., 2018).

A nearby definitional issue remains unresolved for dense reducibility. The paper develops a partial-oracle viewpoint and proves equivalence with enumeration-operator definitions for generic reducibility, but for dense reducibility the analogous equivalence is left open as Open Question 7.7. This does not affect the definition of effective dense reducibility itself, whose use of total $S \subseteq \omega$2-valued descriptions already supports a direct Turing-functional formulation (Astor et al., 2018).

4. Degree structures and embeddings

Each reducibility induces a degree structure by quotienting sets under mutual reducibility. For effective dense reducibility, both uniform and nonuniform versions yield partial orders of degrees. A central technical device is the coding map

$S \subseteq \omega$3

together with

$S \subseteq \omega$4

and

$S \subseteq \omega$5

Lemma 5.1 establishes conversion principles between cofinite descriptions of $S \subseteq \omega$6 and dense or effective dense descriptions of $S \subseteq \omega$7. On that basis, Proposition 5.2 proves several embeddings. In particular, $S \subseteq \omega$8 induces embeddings of Turing degrees into nonuniform dense degrees and into nonuniform effective dense degrees, and it also embeds strong cofinite degrees into uniform effective dense degrees. Furthermore, $S \subseteq \omega$9 and hence $S \cap n = S \cap \{0,1,\dots,n-1\}$0 embed Turing degrees into uniform effective dense degrees (Astor et al., 2018).

These embeddings are not surjective. Theorem 5.9 states that every weakly $S \cap n = S \cap \{0,1,\dots,n-1\}$1-random or $S \cap n = S \cap \{0,1,\dots,n-1\}$2-generic set is quasiminimal in all asymptotic degree structures considered, including the uniform and nonuniform effective dense degrees. Every $S \cap n = S \cap \{0,1,\dots,n-1\}$3-random set is quasiminimal in the uniform generic, coarse, and effective dense degrees, although there exist $S \cap n = S \cap \{0,1,\dots,n-1\}$4-random sets that are not quasiminimal in the nonuniform generic, coarse, dense, and effective dense degrees. In the terminology of the paper, a quasiminimal degree is nonzero and not above any nonzero degree in the image of the embedding induced by $S \cap n = S \cap \{0,1,\dots,n-1\}$5 (Astor et al., 2018).

This degree-theoretic picture shows that effective dense reducibility is not merely a rephrasing of Turing reducibility under partial information loss. The block codings place ordinary Turing information into sparsely distributed locations that survive density-$S \cap n = S \cap \{0,1,\dots,n-1\}$6 masking, while quasiminimality results show that many asymptotic degrees lie outside the embedded Turing image.

5. Measure-theoretic behavior and minimal-pair phenomena

Section 6 of the 2018 paper studies upper cones. For effective dense computability, Theorem 6.5 states that if $S \cap n = S \cap \{0,1,\dots,n-1\}$7 is not effectively densely computable, then

$S \cap n = S \cap \{0,1,\dots,n-1\}$8

and no such $S \cap n = S \cap \{0,1,\dots,n-1\}$9 is weakly $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$0-random relative to $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$1. Parallel theorems are proved for generic, dense, and coarse computability, with weakly $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$2-randomness appearing in the generic and dense cases and weakly $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$3-randomness in the effective dense and coarse cases (Astor et al., 2018).

The proof pattern for effective dense computability is especially close to the coarse case. Because effective dense descriptions are total and use an explicit $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$4 signal, the argument can take a “two-way majority”: either the value $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$5 or the symbol $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$6 dominates in measure exceeding $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$7, from which one extracts a computable effective dense description. The paper explicitly notes that effective dense descriptions are total with explicit “$\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$8” signal and that many arguments resemble coarse ones more than generic ones (Astor et al., 2018).

Minimal pairs are known for dense degrees but not for effective dense degrees. Corollary 6.7 shows that if $\rho(S)=\limsup_{n\to\infty}\frac{|S\cap n|}{n},$9 is not densely computable and $\omega$00 is weakly $\omega$01-random relative to $\omega$02, then $\omega$03 and $\omega$04 form a minimal pair for relative dense computability: any $\omega$05 densely computable relative to both $\omega$06 and $\omega$07 is densely computable. By contrast, Open Question 7.3 asks whether there are minimal pairs in the uniform or nonuniform effective dense degrees, and likewise for relative effective dense computability (Astor et al., 2018).

A common simplification is to treat effective dense reducibility as differing from coarse reducibility only by the presence of an explicit no-answer symbol. The upper-cone arguments do show a close formal resemblance, but the later comparison with coarse reducibility reveals that this resemblance does not extend to complexity or to the structure of degrees.

6. Functions versus sets, complexity, forcing, and later developments

A substantial later development is the comparison between effective dense reducibility and coarse reducibility on $\omega$08 and $\omega$09. Theorem 4.1 of the 2025 paper shows that for coarse reducibility there are computable functionals

$\omega$10

such that, for every $\omega$11, the maps $\omega$12 and $\omega$13 witness two-way uniform coarse reducibility and satisfy $\omega$14. Hence every uniform coarse degree contains a set. Effective dense reducibility behaves differently: Theorem 3.1 states that if $\omega$15 is $\omega$16-generic, then there is no set $\omega$17 with $\omega$18. Thus even non-uniform effective dense degrees of functions need not contain any set (Gerdes, 9 Aug 2025).

The same paper shows that non-uniform effective dense reducibility is highly complex. Theorem 3.2 states that

$\omega$19

is a $\omega$20 property on reals and is $\omega$21-complete. More precisely, there is a computable functional that, given $\omega$22 and $\omega$23, produces $\omega$24 indices for $\omega$25 and $\omega$26 such that

$\omega$27

The construction also proves a strong non-uniformity statement: there is a strictly monotone computable function $\omega$28 such that no single computable $\omega$29 works uniformly on all masked inputs $\omega$30 whose strong domains approach density $\omega$31 at the rates $\omega$32 (Gerdes, 9 Aug 2025).

By contrast, coarse reducibility is arithmetic. Theorem 5.1 shows that there are $\omega$33 formulas $\omega$34 and $\omega$35 such that

$\omega$36

The paper summarizes this contrast as follows: for coarse reducibility, functions and sets share the same degrees uniformly and the reducibility relation is arithmetical; for effective dense reducibility, degrees of functions differ from degrees of sets, and the reducibility relation is $\omega$37-complete (Gerdes, 9 Aug 2025).

Technically, the 2025 work introduces forcing notions tailored to density-$\omega$38 constraints. Zero-density forcing $\omega$39 and its extensions $\omega$40 and $\omega$41 support the effective dense separation, while coarse forcing $\omega$42 supports the arithmetical classification of coarse reducibility. In the effective dense construction, masking sets $\omega$43 of density $\omega$44 and helper sets $\omega$45 allow decoding from both the visible values of $\omega$46 and the pattern of masked positions. This makes precise an important structural feature of effective dense reducibility: information can be coded not only in function values but also in where the description says “$\omega$47” (Gerdes, 9 Aug 2025).

Several open problems remain active. From the 2018 paper: whether there are minimal pairs in effective dense degrees; whether implications hold between effective dense and generic, coarse, or dense reducibility in uniform or nonuniform form; and whether randomness thresholds in the upper-cone theorems can be lowered. From the 2025 paper: the complexity of uniform effective dense reducibility, the complexity of the relation restricted to sets, whether $\omega$48 is $\omega$49-complete, and how to characterize the class of functions whose non-uniform effective dense degree contains a set (Astor et al., 2018, Gerdes, 9 Aug 2025).