In 1973, Andrey Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let each datum be a finite binary string and a model be a finite set of binary strings. Consider model classes consisting of models of given maximal Kolmogorov complexity. The Kolmogorov structure function of an individual data string expresses the relation between the complexity level constraint on a model class and the least log-cardinality of a model in the class containing the data. The structure function determines all stochastic properties of the individual data string: for every constrained model class it determines the individual best-fitting model in the class irrespective of whether the true model is in the model class considered or not. In the classical case we talk about a set of data with a probability distribution, and the properties are those of the expectations. In contrast, here we deal with individual data strings and the properties of the individual string focused on. In this setting, a property holds with certainty rather than with high probability as in the classical case. The Kolmogorov structure function precisely quantifies the goodness-of-fit of an individual model with respect to individual data. The Kolmogorov structure function is used in the algorithmic information theory, also known as the theory of Kolmogorov complexity, for describing the structure of a string by use of models of increasing complexity. Kolmogorov's definition The structure function was originally proposed by Kolmogorov in 1973 at a Soviet Information Theory symposium in Tallinn, but these results were not published p. 182. But the results were announced in in 1974, the only written record by Kolmogorov himself. One of his last scientific statements is (translated from the original Russian by L.A. Levin): Contemporary definition It is discussed in Cover and Thomas. It is extensively studied in Vereshchagin and Vitányi where also the main properties are resolved. The Kolmogorov structure function can be written as where is a binary string of length with where is a contemplated model (set of n-length strings) for , is the Kolmogorov complexity of and is a nonnegative integer value bounding the complexity of the contemplated 's. Clearly, this function is nonincreasing and reaches for where is the required number of bits to change into and is the Kolmogorov complexity of . The algorithmic sufficient statistic We define a set containing such that . The function never decreases more than a fixed independent constant below