Regression and Algorithmic Information Theory

04/16/2023

∙

by   Samuel Epstein, et al.

∙

0

∙

share

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.