BÜCHER VERSANDKOSTENFREI INNERHALB DEUTSCHLANDS
Automatic Complexity
A Computable Measure of Irregularity
De Gruyter
ISBN 978-3-11-077481-8
Standardpreis
Bibliografische Daten
Fachbuch
Buch. Hardcover
2024
9 s/w-Abbildungen, 5 Farbabbildungen, 7 s/w-Tabelle.
In englischer Sprache
Umfang: 156 S.
Format (B x L): 17 x 24 cm
Gewicht: 394
Verlag: De Gruyter
ISBN: 978-3-11-077481-8
Weiterführende bibliografische Daten
Das Werk ist Teil der Reihe: de Gruyter Series in Logic and Its Applications; 12
Produktbeschreibung
Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata. The complexities of many types of words are studied, including random words, normal words, Fibonacci words, Thue words, and words produced by linear feedback shift registers.
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.
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.
Autorinnen und Autoren
Produktsicherheit
Hersteller
De Gruyter GmbH
Genthiner Straße 13
10785 Berlin, DE
productsafety@degruyterbrill.com
Rezensionen
