Kolmogorov Complexity and Computational Complexity by Osamu WatanabeKolmogorov Complexity and Computational Complexity by Osamu Watanabe

Kolmogorov Complexity and Computational Complexity

byOsamu Watanabe

Paperback | December 21, 2011

Pricing and Purchase Info

$202.71 online 
$219.50 list price save 7%
Earn 1,014 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


The mathematical theory of computation has given rise to two important ap­ proaches to the informal notion of "complexity": Kolmogorov complexity, usu­ ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu­ tational complexity, usually a complexity measure for a set of objects, measures the compuational resources necessary to recognize or produce elements of the set. The relation between these two complexity measures has been considered for more than two decades, and may interesting and deep observations have been obtained. In March 1990, the Symposium on Theory and Application of Minimal­ Length Encoding was held at Stanford University as a part of the AAAI 1990 Spring Symposium Series. Some sessions of the symposium were dedicated to Kolmogorov complexity and its relations to the computational complexity the­ ory, and excellent expository talks were given there. Feeling that, due to the importance of the material, some way should be found to share these talks with researchers in the computer science community, I asked the speakers of those sessions to write survey papers based on their talks in the symposium. In response, five speakers from the sessions contributed the papers which appear in this book.
Title:Kolmogorov Complexity and Computational ComplexityFormat:PaperbackDimensions:105 pages, 23.5 × 15.5 × 0.07 inPublished:December 21, 2011Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642777376

ISBN - 13:9783642777370

Look for similar items by category:


Table of Contents

Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory.- On Sets with Small Information Content.- Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness.- Resource Bounded Kolmogorov Complexity and Statistical Tests.- Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity.