2 problems
- 0 votes0 replies0 views
The impossibility of matching infinite-alphabet minimax redundancy with dynamic finite projections
Infinite-degree-of-freedom projection conjecture. The complexity of , measured by the rate at which the minimax redundancy per sample
- 0 votes0 replies0 views
Ott–Tomforde–Willis conjecture on distinct step-shift conjugacy classes
Let . An -step shift space is a one-sided shift space over an infinite alphabet described by forbidden blocks of length , while an -step shi…