Methods and Applications of Algorithmic Complexity

Recent research on Evaluating the Kolmogorov Complexity of Short Strings

Presents an Alternative to Compression Algorithms

Written by leading experts in the field

Provides recent research on evaluating the Kolmogorov complexity of short strings Presents an alternative to compression algorithms Written by leading experts in the field

Résumé
"The book starts practically from scratch: It defines Turing machines, Kolmogorov complexity, etc. So this book can be recommended not only to researchers in this area, but also to students and to researchers from other areas interested in complexity issues." (Vladik Ya. Kreinovich, zbMATH 1497.68008, 2022)

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