Regression and Algorithmic Information Theory
Computational Complexity
2023-04-18 v1
Abstract
In this paper we prove a theorem about regression, in that the shortest description of a function consistent with a finite sample of data is less than the combined conditional Kolmogorov complexities over the data in the sample.
Cite
@article{arxiv.2304.07825,
title = {Regression and Algorithmic Information Theory},
author = {Samuel Epstein},
journal= {arXiv preprint arXiv:2304.07825},
year = {2023}
}