书目名称 | Methods and Applications of Algorithmic Complexity | 副标题 | Beyond Statistical L | 编辑 | Hector Zenil,Fernando Soler Toscano,Nicolas Gauvri | 视频video | | 概述 | Provides recent research on evaluating the Kolmogorov complexity of short strings.Presents an alternative to compression algorithms.Written by leading experts in the field | 丛书名称 | Emergence, Complexity and Computation | 图书封面 |  | 描述 | .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 | 出版日期 | Book 2022 | 关键词 | Complexity; Compression Algorithms; Kolmogorov Complexity; Short Strings; Algorithmic Complexity; Lossles | 版次 | 1 | doi | https://doi.org/10.1007/978-3-662-64985-5 | isbn_ebook | 978-3-662-64985-5Series ISSN 2194-7287 Series E-ISSN 2194-7295 | issn_series | 2194-7287 | copyright | Springer-Verlag GmbH Germany, part of Springer Nature 2022 |
The information of publication is updating
|
|