Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and
123,00 €
The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.
Jetzt bei Ebay:
