Povej prijatelju o tem izdelku:
Kolmogorov Complexity and Computational Complexity - Monographs in Theoretical Computer Science. An EATCS Series Osamu Watanabe Softcover reprint of the original 1st ed. 1992 Edition
Kolmogorov Complexity and Computational Complexity - Monographs in Theoretical Computer Science. An EATCS Series
Osamu Watanabe
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.
105 pages, biography
| Medij | Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom) |
| Izdano | 21. decembra 2011 |
| ISBN13 | 9783642777370 |
| Založniki | Springer-Verlag Berlin and Heidelberg Gm |
| Strani | 105 |
| Dimenzije | 155 × 235 × 6 mm · 176 g |
| Jezik | Nemščina |
| Urednik | Watanabe, Osamu |
Božična darila lahko vrnete do 31. januarja