SOURCE-LINKED INTELLIGENCE

Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity

arXiv · AI, language, vision and robotics · article · Sep 17, 2026 · UTC

In previous papers, we began the study of sequence prediction algorithms adapted to stringological word complexity measures. In particular, we defined a complexity measure called Arithmetic Repetition Complexity (ARC) which admits a polynomial-time prediction algorithm with a mistake bound quasilinear in the complexity. Here, we show a weaker complexity measure related to ARC that admits an especially efficient prediction algorithm: an algorithm that runs in quasilinear time and polylog space for appropriate highly-structured sequences. The complexity measure is defined via a restricted class

Read original source ↗ Open in workspace

recordType

paper

region

Global