Kolmogorov Complexity and Computational Complexity
By: edited by Osamu Watanabe
Series: EATCS Monographs on Theoretical Computer Science, 1431-2654; EATCS monographs on theoretical computer science
Publisher: Springer Berlin Heidelberg
Published: 1992
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 105
ISBN-13: 9783642777356
Description: 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.