ACM SIGACT News · 1997 · 587 citations · 0 references
ComputingComputer ScienceAlgorithmsProbability TheoryStochastic ProcessesComputational ComplexityLaw Of Large NumbersMarkov ProcessesKolmogorov - Smirnov TestKolmogorov AxiomsKolmogorov ComplexityKolmogorov Extension TheoremKolmogorov InequalityKolmogorov TheoryKolmogorov-sinai Entropy
The string 111111111111 looks "less random" then the string 100110001001. Kolmogorov complexity makes this intuitive notion of randomness rigorous. Once this is done, new questions arise and some old questions can be answered. This book spends half of its time making these notions rigorous, and the other half applying them. More precisely: