Automatic Complexity

A Computable Measure of Irregularity

Bjørn Kjos-Hanssen (Autor)

Buch | Hardcover

XII, 144 Seiten

2024
De Gruyter (Verlag)
978-3-11-077481-8 (ISBN)

Infos

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.

Autor

lt;p>Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.

Produkt-Details

• Erscheinungsdatum: 19.01.2024
• Reihe/Serie: De Gruyter Series in Logic and Its Applications ; 12
• Zusatzinfo: 9 b/w and 5 col. ill., 7 b/w tbl.
• Verlagsort: Berlin/Boston
• Sprache: englisch
• Maße: 170 x 240 mm
• Gewicht: 394 g
• Themenwelt: Informatik ► Software Entwicklung ► User Interfaces (HCI)
• Themenwelt: Mathematik / Informatik ► Mathematik
• Schlagworte: Complexity • Fibonacci words. • Kolmogorov structures • normal words • random words
• ISBN-10: 3-11-077481-X / 311077481X
• ISBN-13: 978-3-11-077481-8 / 9783110774818
• Zustand: Neuware