An Introduction to Kolmogorov Complexity and Its Applications
Library Home || Full Table of Contents || Suggest a Link || Library Help
|2nd edition textbook on the subject, which can be ordered through the Web. A postscript file of contents is also available. The incompressibility method and Kolmogorov complexity is a versatile mathematical tool, a sharper relative of classical information theory (absolute information of individual object rather than average information over a random ensemble) that satisfies many of the laws of classical information theory - although with a slight error term.|
|Math Topics:||Discrete Math, Combinatorics, History and Biography, Operations Research, Probability, Statistics, Computer Science|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.