Methods and applications of algorithmic complexity : beyond statistical lossless compression / Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit.
2022
QA76.9.A43
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Methods and applications of algorithmic complexity : beyond statistical lossless compression / Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit.
Author
Zenil, Hector, author.
ISBN
9783662649855 (electronic bk.)
3662649853 (electronic bk.)
9783662649831
3662649837
3662649853 (electronic bk.)
9783662649831
3662649837
Published
Berlin : Springer, [2022]
Copyright
©2022
Language
English
Description
1 online resource : illustrations (some color).
Item Number
10.1007/978-3-662-64985-5 doi
Call Number
QA76.9.A43
Dewey Decimal Classification
005.1
Summary
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 information theory 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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed May 27, 2022).
Series
Emergence, complexity and computation ; 44.
Available in Other Form
Print version: 9783662649831
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
Preliminaries
Enumerating and simulating Turing machines
The Coding Theorem Method
Theoretical aspects of nite approximations to Levins semi-measure.
Enumerating and simulating Turing machines
The Coding Theorem Method
Theoretical aspects of nite approximations to Levins semi-measure.