1 citations · 2 across the 9 of their papers we have counts for
4 papers · 1 filter
Predictions and algorithmic statistics for infinite sequence
Alexey Milovanov
Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $…
On Algorithmic Statistics for space-bounded algorithms
Alexey Milovanov
Algorithmic statistics studies explanations of observed data that are good in the algorithmic sense: an explanation should be simple i.e. should have small Kolmogorov complexity an…
Algorithmic statistics: normal objects and universal models
Alexey Milovanov
Kolmogorov suggested to measure quality of a statistical hypothesis for a data by two parameters: Kolmogorov complexity of the hypothesis and the probability …
Some properties of antistochastic strings
Alexey Milovanov
Antistochastic strings are those strings that lack any reasonable statistical explanations. We establish the follow property of such strings: every absolutely non-stochastic string…