Limits RegistryPUBLIC RECORDLimits RegistryResearch Console →Online halving makes at most logarithmically many mistakes when a finite class contains a perfect hypothesis.
The question, scope, and sources behind this Registry record.
Under the recorded learning theory model, establish mistakes <= floor(log2 |H|).
Current frontiers derived from accepted Claims.
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-003605. Halving algorithm realizable mistake bound. 2026.