2005•Unpublished venueRequires access

Kolmogorov Complexity

Thomas M. Cover, Joy A. Thomas

Abstract

This chapter contains sections titled: Models of Computation Kolmogorov Complexity: Definitions and Examples Kolmogorov Complexity and Entropy Kolmogorov Complexity of Integers Algorithmically Random and Incompressible Sequences Universal Probability Kolmogorov complexity Ω Universal Gambling Occam's Razor Kolmogorov Complexity and Universal Probability Kolmogorov Sufficient Statistic Minimum Description Length Principle Summary Problems Historical Notes

About this research paper

What this paper is about

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Kolmogorov complexity, Kolmogorov structure function, occam, Mathematics, Kolmogorov equations (Markov jump process), Statistic, Entropy (arrow of time), Occam's razor