E-Book, Englisch, 156 Seiten
Reihe: ISSN
Kjos-Hanssen Automatic Complexity
1. Auflage 2024
ISBN: 978-3-11-077490-0
Verlag: De Gruyter
Format: EPUB
Kopierschutz: 6 - ePub Watermark
A Computable Measure of Irregularity
E-Book, Englisch, 156 Seiten
Reihe: ISSN
ISBN: 978-3-11-077490-0
Verlag: De Gruyter
Format: EPUB
Kopierschutz: 6 - ePub Watermark
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