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.
By:
Bjørn Kjos-Hanssen Imprint: De Gruyter Country of Publication: Germany Dimensions:
Height: 240mm,
Width: 170mm,
ISBN:9783110774818 ISBN 10: 311077481X Series:De Gruyter Series in Logic & its Applications Pages: 156 Publication Date:19 February 2024 Audience:
Professional and scholarly
,
Undergraduate
Format:Hardback Publisher's Status: Active
Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.