An Introduction to Kolmogorov Complexity and Its Applications

By Ming Li, Paul M. B. Vitányi. Texts in Computer Science, 2019

380 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/a222764ed0176fc1d32ab5cab6588f6e9e426b45

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Juan Carlos García-Escartín
2. Miguel Herrero-Collantes

Citations in the corpus

• Quantum random number generators (2016, background): “Apart from the uncomputable Kolmogorov complexity (Li and Vitányi, 2008), there is no way to deduce that a random string is really random, but there are methods to detect suspicious sequences.”