Kolmogorov complexity and computational complexity

Front Cover
Osamu Watanabe
Springer-Verlag, 1992 - Computers - 105 pages
There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures the computational resources necessary to recognize (or produce) an object. The relation between these two complexity measures has been studied since the 1960s. More recently, the more generalized notion of resource bounded Kolmogorov complexity and its relation to computational complexity have received much attention. Now many interesting and deep observations on this topic have been established. This book consists of four survey papers concerning these recent studies on resource bounded Kolmogorov complexity and computational complexity. It also contains one paper surveying several types of Kolmogorov complexity measures. The papers are based on invited talks given at the AAAI Spring Symposium on Minimal-Length Encoding in 1990. The book is the only collection of survey papers on this subject and provides fundamental information for researchers in the field.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


On Sets with Small Information Content
Kolmogorov Complexity Complexity Cores

3 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information