On Kolmogorov Structure Functions
Computational Complexity
2024-07-11 v3
Abstract
All strings with low mutual information with the halting sequence will have flat Kolmogorov Structure Functions, in the context of Algorithmic Statistics. Assuming the Independence Postulate, strings with non-negligible information with the halting sequence are purely mathematical constructions, and cannot be found in nature. Thus Algorithmic Statistics does not study strings in the physical world. This leads to the general thesis that two part codes require limitations as shown in the Minimum Description Length Principle. We also discuss issues with set-restricted Kolmogorov Structure Functions.
Cite
@article{arxiv.2406.05903,
title = {On Kolmogorov Structure Functions},
author = {Samuel Epstein},
journal= {arXiv preprint arXiv:2406.05903},
year = {2024}
}