CAS II: Orbits as Models: Kolmogorov's Structure Function under Symmetry

Excerpt

arXiv:2609.40290v2 Announce Type: replace-cross Abstract: In algorithmic statistics a string x is explained by a finite set containing it, and Kolmogorov's structure function records the smallest such model at each level of complexity. Strong models, those computable from the data by a total algorithm, are essentially the cells of simple partitions, so a partition of {0,1}^n can be read as a hypothesis and the cell containing x as the model it assigns. We develop algorithmic statistics over symm