Buch, Englisch, Band 12, 144 Seiten, Format (B × H): 170 mm x 240 mm, Gewicht: 394 g
A Computable Measure of Irregularity
Buch, Englisch, Band 12, 144 Seiten, Format (B × H): 170 mm x 240 mm, Gewicht: 394 g
Reihe: De Gruyter Series in Logic and Its Applications
ISBN: 978-3-11-077481-8
Verlag: De Gruyter
Automatic complexity is a computable and visual form of Kolmogorov complexity. Introduced by Shallit and Wang in 2001, it replaces Turing machines by finite automata, and has connections to normalized information distance, logical depth, and linear diophantine equations. Automatic Complexity is the first book on the subject and includes exercises with solutions written for the proof assistant Lean, computer programs to calculate automatic complexity, and many open problems.
Zielgruppe
Libraries, Graduate students, researchers in mathematics and comp
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik