Kontakt
Jak kupować
Dostawa
Doradca ds. zakupów
Kolmogorov Complexity and Computational Complexity
Angielski
249 b
Nawet do 30 dni na zwrot
Klienci kupili także
/
Miękka
147.35
zł
/
Miękka
70.02
zł
/
Miękka
67.56
zł
/
Miękka
77.93
zł
/
Miękka
44.76
zł
/
Miękka
250.96
zł
/
Miękka
112.74
zł
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.
Informacje o książce
Angielski
Podaruj tę książkę jeszcze dziś
To łatwe
1 Dodaj książkę do koszyka i wybierz „dostarczyć jako prezent” 2 W odpowiedzi wyślemy Ci bon 3 Książka dotrze na adres obdarowanegoMogłoby Cię także zainteresować
/
Twarda
174.05
zł
/
Miękka
48.56
zł
/
Miękka
157.72
zł
/
Adobe ePub DRM
203.93
zł
Cześć! Jestem Libroamiko, Twój doradca książkowy.
Jak mogę Ci pomóc?