Methods and applications of algorithmic complexity. Beyond statistical lossless compression

DOI10.1007/978-3-662-64985-5MaRDI QIDQ2122124zbMATH OpenOpenAlexFDO

Authors Nicolas Gauvrit, Hector Zenil, Fernando Soler-Toscano

Publication date 5 April 2022

Published in Emergence, Complexity and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-64985-5

zbMATH Keywords

cellular automataKolmogorov complexityrandomnessTuring machines

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Algorithmic Information Dynamics
• Algorithmic information theory for physicists and natural scientists
• An introduction to Kolmogorov complexity and its applications
• scientific article; zbMATH DE number 736618
• scientific article; zbMATH DE number 1010621

Cited in

(21)

• Bridging algorithmic information theory and machine learning: a new approach to kernel learning
• Compression and diffusion: a joint approach to detect complexity.
• Large alphabets and incompressibility
• An introduction to Kolmogorov complexity and its applications
• Compression of Multivariate Discrete Measures and Applications
• A safe approximation for Kolmogorov complexity
• Applications of Kolmogorov complexity and universal codes to nonparametric estimation of characteristics of time series
• Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness
• Automatic complexity. A computable measure of irregularity
• Maximizing T-complexity
• Algorithmic Information Dynamics
• Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities
• Cost-effectiveness of algorithms
• scientific article; zbMATH DE number 2066908 (Why is no real title available?)
• Randomness extraction in computability theory
• Using ideas of Kolmogorov complexity for studying biological texts
• Algorithmic techniques for the polymer sciences
• A computable measure of algorithmic probability by finite approximations with an application to integer sequences
• Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
• Algorithmic relative complexity
• Correspondence and independence of numerical evaluations of algorithmic information measures

This page was built for publication: Methods and applications of algorithmic complexity. Beyond statistical lossless compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2122124)