Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Kolmogorov Complexity and Computational Complexity
Angličtina
249 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
14.84
€
/
Brožovaná
9.79
€
/
Brožovaná
16.16
€
/
Brožovaná
25.96
€
/
Brožovaná
57.78
€
/
Brožovaná
33.94
€
/
Brožovaná
17.97
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Pevná
38.18
€
/
Brožovaná
34.54
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?