Vertel uw vrienden over dit artikel:
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
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 21 december 2011 |
| ISBN13 | 9783642777370 |
| Uitgevers | Springer-Verlag Berlin and Heidelberg Gm |
| Pagina's | 105 |
| Afmetingen | 155 × 235 × 6 mm · 176 g |
| Taal en grammatica | Duits |
| Uitgever | Watanabe, Osamu |
Kerstcadeautjes kunnen tot en met 31 januari worden ingewisseld