Limits RegistryPAPER

Limits Registry

Registry Open Limits Search Graph Breakthroughs Challenges Bounties

Research Console →

Communications of the ACM

A theory of the learnable

Authoritative source supporting the registered AI theorem or explicitly scoped empirical frontier.

DOI: 10.1145/1968.19721984Source ↗

01

Limits established by this paper

2026

CLM-AI-003604= m = O((log|H| + log(1/delta))/epsilon^2)LR-003604 — Finite-class agnostic uniform-convergence bound

ACCEPTED

2026

CLM-AI-003603>= m >= (log|H| + log(1/delta))/epsilonLR-003603 — Finite-class consistent PAC sample bound

ACCEPTED

LR / 2026Evidence before assertion.About Articles Researchers Collections Knowledge graph Methodology Compare Certificate preview Editorial policy Support Privacy Terms