Automatic Complexity - A Computable Measure of Irregularity

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.

Product details

• Authors: Bjørn Kjos-Hanssen
• Publisher: De Gruyter
• Languages: English
• Product format: Hardback
• Released: 01.02.2024
• EAN: 9783110774818
• ISBN: 978-3-11-077481-8
• No. of pages: 144
• Dimensions: 181 mm x 14 mm x 245 mm
• Weight: 394 g
• Illustrations: 9 b/w and 5 col. ill., 7 b/w tbl.
• Series: De Gruyter Series in Logic and Its Applications
• Subject: Natural sciences, medicine, IT, technology > Mathematics