Methods and Applications of Algorithmic Complexity [E-Book] : Beyond Statistical Lossless Compression / by Hector Zenil, Fernando Soler Toscano, Nicolas Gauvrit.
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 entail...
Saved in:
Full text |
|
Personal Name(s): | Zenil, Hector, author |
Gauvrit, Nicolas, author / Toscano, Fernando Soler, author | |
Edition: |
1st edition 2022. |
Imprint: |
Berlin, Heidelberg :
Springer,
2022
|
Physical Description: |
IX, 267 pages 108 illustrations, 55 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783662649855 |
DOI: |
10.1007/978-3-662-64985-5 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Emergence, Complexity and Computation ;
44 |
Subject (LOC): |
- Preliminaries
- Enumerating and simulating Turing machines
- The Coding Theorem Method
- Theoretical aspects of finite approximations to Levin's semi-measure.