| 000 | 04861nam a22006015i 4500 | ||
|---|---|---|---|
| 999 |
_c200457507 _d75719 |
||
| 003 | TR-AnTOB | ||
| 005 | 20231121134602.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220516s2022 gw | s |||| 0|eng d | ||
| 020 | _a9783662649855 | ||
| 024 | 7 |
_a10.1007/978-3-662-64985-5 _2doi |
|
| 040 |
_aTR-AnTOB _beng _erda _cTR-AnTOB |
||
| 041 | _aeng | ||
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aTBJ _2bicssc |
|
| 072 | 7 |
_aGPFC _2bicssc |
|
| 072 | 7 |
_aTEC009000 _2bisacsh |
|
| 072 | 7 |
_aTBJ _2thema |
|
| 072 | 7 |
_aGPFC _2thema |
|
| 090 | _aQA76.9.A43EBK | ||
| 100 | 1 |
_aZenil, Hector. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 245 | 1 | 0 |
_aMethods and Applications of Algorithmic Complexity _h[electronic resource] : _bBeyond Statistical Lossless Compression / _cby Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit. |
| 250 | _a1st ed. 2022. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2022. |
|
| 300 | _a1 online resource | ||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aEmergence, Complexity and Computation, _x2194-7295 ; _v44 |
|
| 505 | 0 | _aPreliminaries -- Enumerating and simulating Turing machines -- The Coding Theorem Method -- Theoretical aspects of finite approximations to Levin’s semi-measure. | |
| 520 | _aThis 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 | _aDynamics. | |
| 650 | 0 | _aNonlinear theories. | |
| 650 | 0 | _aComputational intelligence. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aApplied Dynamical Systems. |
| 650 | 2 | 4 | _aComputational Intelligence. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 653 | 0 | _aComputer algorithms | |
| 653 | 0 | _aComputational complexity | |
| 653 | 0 | _aData compression (Computer science) | |
| 700 | 1 |
_aToscano, Fernando Soler. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 700 | 1 |
_aGauvrit, Nicolas. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 830 | 0 |
_aEmergence, Complexity and Computation, _x2194-7295 ; _v44 |
|
| 856 | 4 | 0 |
_uhttps://doi.org/10.1007/978-3-662-64985-5 _3Springer eBooks _zOnline access link to the resource |
| 942 |
_2lcc _cEBK |
||