Article ID Journal Published Year Pages File Type
437075 Theoretical Computer Science 2006 9 Pages PDF
Abstract

We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are suggested.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics