.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Kolmogorov Complexity and Computational Complexity
Osamu . Ed(S): Watanabe
€ 126.02
FREE Delivery in Ireland
Description for Kolmogorov Complexity and Computational Complexity
Paperback. Editor(s): Watanabe, Osamu. Series: Monographs in Theoretical Computer Science : An Eatcs Series. Num Pages: 112 pages, biography. BIC Classification: PBV; UMB; UYZG. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 6. Weight in Grams: 196.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2011
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
112
Condition
New
Series
Monographs in Theoretical Computer Science : An Eatcs Series
Number of Pages
105
Place of Publication
Berlin, Germany
ISBN
9783642777370
SKU
V9783642777370
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Kolmogorov Complexity and Computational Complexity