A theory of incremental compression

The ability to find short representations, i.e. compress data, is crucial for many intelligent systems. We present a theory of incremental compression showing that arbitrary data strings, can be described by set features, compressed searching those features incrementally, which results in partition the information content string into complete pairwise independent pieces. description length this turns out close optimal terms Kolmogorov complexity string. Exploiting decomposition, we introduce ALICE - computable ALgorithm Incremental ComprEssion and derive an expression its time complexity. Finally, show our concept feature closely related Martin-L\"of randomness tests, thereby formalizing meaning "property" objects.