Unverified50% confidenceFactExact time
To reduce prediction error to level τ, the required number of states or modes is r=Θ(log²(1/τ)), i.e., the square-logarithmic state complexity law.
1
Sources
50%
Confidence
Long-term
Relevance
10/8/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe academic community conjectures that the optimal complexity lower bound for integer multiplication is Ω(n log n), but this has not been rigorously proved to date and remains an empirical conjecture.69% similarUnverifiedWhen measuring prediction error after fractional integration, there is an exact 1/L leading-order error for forecasting from a finite context of length L.67% similarVerifiedThe generalization error of a model equals the squared bias plus variance plus irreducible noise.64% similarUnverifiedWhen the fractional intensity d is fixed, the state complexity still obeys the square-logarithmic law.64% similarUnverifiedε-prediction is prone to numerical instability at large embedding dimensions, because when α_bar_t approaches zero the scaling factor 1/sqrt(α_bar_t) tends to infinity, amplifying prediction errors.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/986780API
curl https://kongchang.com/api/v1/knowledge/claims/986780MCP
get_claim(id=986780)