Dekorationsartikel gehören nicht zum Leistungsumfang.
Methods and Applications of Algorithmic Complexity
Beyond Statistical Lossless Compression
Buch von Hector Zenil (u. a.)
Sprache: Englisch

153,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-3 Wochen

Kategorien:
Beschreibung
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 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.
Zusammenfassung
Recent research on Evaluating the Kolmogorov Complexity of Short Strings

Presents an Alternative to Compression Algorithms

Written by leading experts in the field
Inhaltsverzeichnis
¿Preliminaries.- Enumerating and simulating Turing machines.- The Coding Theorem Method.- Theoretical aspects of ¿nite approximations to Levin's semi-measure.
Details
Erscheinungsjahr: 2022
Fachbereich: Technik allgemein
Genre: Technik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 280
Reihe: Emergence, Complexity and Computation
Inhalt: ix
267 S.
53 s/w Illustr.
55 farbige Illustr.
267 p. 108 illus.
55 illus. in color.
ISBN-13: 9783662649831
ISBN-10: 3662649837
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Zenil, Hector
Gauvrit, Nicolas
Toscano, Fernando Soler
Auflage: 1st ed. 2022
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Emergence, Complexity and Computation
Maße: 241 x 160 x 21 mm
Von/Mit: Hector Zenil (u. a.)
Erscheinungsdatum: 17.05.2022
Gewicht: 0,588 kg
preigu-id: 121145607
Zusammenfassung
Recent research on Evaluating the Kolmogorov Complexity of Short Strings

Presents an Alternative to Compression Algorithms

Written by leading experts in the field
Inhaltsverzeichnis
¿Preliminaries.- Enumerating and simulating Turing machines.- The Coding Theorem Method.- Theoretical aspects of ¿nite approximations to Levin's semi-measure.
Details
Erscheinungsjahr: 2022
Fachbereich: Technik allgemein
Genre: Technik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 280
Reihe: Emergence, Complexity and Computation
Inhalt: ix
267 S.
53 s/w Illustr.
55 farbige Illustr.
267 p. 108 illus.
55 illus. in color.
ISBN-13: 9783662649831
ISBN-10: 3662649837
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Zenil, Hector
Gauvrit, Nicolas
Toscano, Fernando Soler
Auflage: 1st ed. 2022
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Emergence, Complexity and Computation
Maße: 241 x 160 x 21 mm
Von/Mit: Hector Zenil (u. a.)
Erscheinungsdatum: 17.05.2022
Gewicht: 0,588 kg
preigu-id: 121145607
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte