Limits RegistryPUBLIC RECORDLimits RegistryResearch Console →Optimal deterministic realizable online mistake complexity equals the class Littlestone dimension.
The question, scope, and sources behind this Registry record.
Under the recorded learning theory model, establish optimal worst-case mistakes = Littlestone dimension.
Current frontiers derived from accepted Claims.
The accepted equality closes this optimization result.
Assertions tied to evidence, attribution, and review.
The frontier as it changed over time.
Only accepted Claims matching the current specification contribute to the displayed bounds. Strict inequalities remain open; contradictory Claims require editorial review.
No accepted machine-checked reproductions are recorded for this Limit.
Limits Registry. LR-003609. Finite-class minimax online mistake bound. 2026.