SULJE VALIKKO

avaa valikko

Gauvrit Nicolas Gauvrit | Akateeminen Kirjakauppa

Haullasi löytyi yhteensä 2 tuotetta
Haluatko tarkentaa hakukriteerejä?



Methods and Applications of Algorithmic Complexity : Beyond Statistical Lossless Compression
Tekijä: Hector Zenil; Fernando Soler Toscano; Nicolas Gauvrit
Kustantaja: Springer (2022)
Saatavuus: Noin 17-20 arkipäivää
EUR   138,50
Methods and Applications of Algorithmic Complexity
Tekijä: Zenil Hector Zenil; Toscano Fernando Soler Toscano; Gauvrit Nicolas Gauvrit
Kustantaja: Springer Nature B.V. (2022)
Saatavuus: Ei tiedossa
EUR   113,90
    
Methods and Applications of Algorithmic Complexity : Beyond Statistical Lossless Compression
138,50 €
Springer
Sivumäärä: 267 sivua
Asu: Kovakantinen kirja
Julkaisuvuosi: 2022, 17.05.2022 (lisätietoa)
Kieli: Englanti

This book explores a different pragmatic approach to algorithmic complexity rooted or motivated by the theoretical foundations of algorithmic probability and explores the relaxation of necessary and sufficient conditions in the pursuit of numerical applicability, with some of these approaches entailing greater risks than others in exchange for greater relevance and applicability.



Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently coexist for the first time, ranging from the dominant ones based upon popular statistical lossless compression algorithms (such as LZW) to newer approaches that advance, complement, and also pose their own limitations. Evidence suggesting that these different methods complement each other for different regimes is presented, and despite their many challenges, some of these methods are better grounded in or motivated by the principles of algorithmic information. 



The authors propose that the field can make greater contributions to science, causation, scientific discovery, networks, and cognition, to mention a few among many fields, instead of remaining either as a technical curiosity of mathematical interest only or as a statistical tool when collapsed into an application of popular lossless compression algorithms. This book goes, thus, beyond popular statistical lossless compression and introduces a different methodological approach to dealing with algorithmic complexity.

For example, graph theory and network science are classic subjects in mathematics widely investigated in the twentieth century, transforming research in many fields of science from economy to medicine. However, it has become increasingly clear that the challenge of analyzing these networks cannot be addressed by tools relying solely on statistical methods. Therefore, model-driven approaches are needed. Recent advances in network science suggest that algorithmic informationtheory could play an increasingly important role in breaking those limits imposed by traditional statistical analysis (entropy or statistical compression) in modeling evolving complex networks or interacting networks.  Further progress on this front calls for new techniques for an improved mechanistic understanding of complex systems, thereby calling out for increased interaction between systems science, network theory, and algorithmic information theory, to which this book contributes.




Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
LISÄÄ OSTOSKORIIN
Tilaustuote | Arvioimme, että tuote lähetetään meiltä noin 17-20 arkipäivässä
Myymäläsaatavuus
Helsinki
Tapiola
Turku
Tampere
Methods and Applications of Algorithmic Complexity : Beyond Statistical Lossless Compressionzoom
Näytä kaikki tuotetiedot
Sisäänkirjautuminen
Kirjaudu sisään
Rekisteröityminen
Oma tili
Omat tiedot
Omat tilaukset
Omat laskut
Lisätietoja
Asiakaspalvelu
Tietoa verkkokaupasta
Toimitusehdot
Tietosuojaseloste