← All problems

Certainty–Scope Conjecture

For every artificial-intelligence mechanism MM, its certainty C(M)C(M) and scope S(M)S(M) satisfy a universal tradeoff of the form C(M)S(M)≤kC(M)S(M)\le k, where kk is a constant independent of MM. Equivalently, no mechanism can simultaneously attain maximal reliability on every input and unrestricted breadth over unstructured data.

References

Source: Minds and Machines

Progress summary

Refreshed
Open · progress reported

A 2026 paper claims to prove a sharp finite version of the conjecture, but the unrestricted claim remains open and another paper claims to disprove its original universal formula.

Floridi’s 2025 conjecture proposes a tradeoff between certainty C(M)C(M) and scope S(M)S(M), expressed as C(M)S(M)≤kC(M)S(M)\le k. The original formulation was explicitly presented as unproved.

Known results

October 2026 finite-case proof claim

Jia, Messina, and Floridi claim an exact finite-classification theorem: a Fano-type converse bounds certainty by scope and mechanism capacity, with the nn-ary symmetric channel attaining equality; they also claim extensions covering composition, side information, post-processing, tools, routing, and context-wise feasibility. The claim establishes only a finite model, not the unrestricted conjecture, and has no independent assessment in the retrieved sources. Separately, an arXiv paper claims that the original universal product bound fails under the published definitions, including with Kolmogorov-complexity and Shannon-entropy variants; this disproof is likewise unverified.

Current status (as of October 2026): the finite-classification result and the claimed disproof of the original universal formulation are both unverified; the unrestricted Certainty–Scope Conjecture remains open.

Sources

Solutions 0

No solutions have been posted yet.