|
|
|||
|
||||
OverviewAutomatic 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. Full Product DetailsAuthor: Bjørn Kjos-HanssenPublisher: De Gruyter Imprint: De Gruyter ISBN: 9783110774818ISBN 10: 311077481 Pages: 156 Publication Date: 19 February 2024 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationBjørn Kjos-Hanssen, University of Hawaii at Manoa, USA. Tab Content 6Author Website:Countries AvailableAll regions |