Methods and Applications of Algorithmic Complexity: Beyond Statistical Lossless Compression eBook

Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 12 hours.
Version: PDF/EPUB. If you need EPUB and MOBI Version, please send contact us.
Compatible Devices: Can be read on any devices.

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.

This is a digital product.

Methods and Applications of Algorithmic Complexity: Beyond Statistical Lossless Compression is written by Hector Zenil; Fernando Soler Toscano; Nicolas Gauvrit and published by Springer. The Digital and eTextbook ISBNs for Methods and Applications of Algorithmic Complexity are 9783662649855, 3662649853 and the print ISBNs are 9783662649831, 3662649837.