國立高雄大學圖資館 |

登入

回首頁

Methods and applications of algorithmic complexitybeyond statistical lossless compression /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Methods and applications of algorithmic complexityby Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit.
其他題名:	beyond statistical lossless compression /
作者:	Zenil, Hector.
其他作者:	Soler Toscano, Fernando.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg :2022.
面頁冊數:	ix, 267 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer algorithms.
電子資源:	https://doi.org/10.1007/978-3-662-64985-5
ISBN:	9783662649855$q(electronic bk.)

Methods and applications of algorithmic complexitybeyond statistical lossless compression /
Zenil, Hector.

Methods and applications of algorithmic complexitybeyond statistical lossless compression /[electronic resource] :by Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit. - Berlin, Heidelberg :Springer Berlin Heidelberg :2022. - ix, 267 p. :ill. (some col.), digital ;24 cm. - Emergence, complexity and computation,v. 442194-7295 ;. - Emergence, complexity and computation ;v.5..

Preliminaries -- Enumerating and simulating Turing machines -- The Coding Theorem Method -- Theoretical aspects of ﬁnite approximations to Levin's semi-measure.

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.

ISBN: 9783662649855$q(electronic bk.)

Standard No.: 10.1007/978-3-662-64985-5doiSubjects--Topical Terms:

184478
Computer algorithms.

LC Class. No.: QA76.9.A43 / Z45 2022

Dewey Class. No.: 005.1

Methods and applications of algorithmic complexitybeyond statistical lossless compression /
LDR:03824nmm a2200361 a 4500 001 621139
003 DE-He213
005 20220516164812.0
006 m d
007 cr nn 008maaau
008 221121s2022 gw s 0 eng d
020 $a 9783662649855$q(electronic bk.)
020 $a 9783662649831$q(paper)
024 7 $a 10.1007/978-3-662-64985-5 $2 doi
035 $a 978-3-662-64985-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b Z45 2022
072 7 $a TBJ $2 bicssc
072 7 $a GPFC $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a TBJ $2 thema
072 7 $a GPFC $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b Z54 2022
100 1 $a Zenil, Hector. $3 575223
245 1 0 $a Methods and applications of algorithmic complexity $h [electronic resource] : $b beyond statistical lossless compression / $c by Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2022.
300 $a ix, 267 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Emergence, complexity and computation, $x 2194-7295 ; $v v. 44
505 0 $a Preliminaries -- Enumerating and simulating Turing machines -- The Coding Theorem Method -- Theoretical aspects of ﬁnite approximations to Levin's semi-measure.
520 $a 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.
650 0 $a Computer algorithms. $3 184478
650 0 $a Computational complexity. $3 185313
650 0 $a Data compression (Computer science) $3 182441
650 1 4 $a Applied Dynamical Systems. $3 913436
650 2 4 $a Computational Intelligence. $3 338479
650 2 4 $a Artificial Intelligence. $3 212515
700 1 $a Soler Toscano, Fernando. $3 922167
700 1 $a Gauvrit, Nicolas. $3 922168
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Emergence, complexity and computation ; $v v.5. $3 674564
856 4 0 $u https://doi.org/10.1007/978-3-662-64985-5
950 $a Engineering (SpringerNature-11647)