Before you leave...
Take 20% off your first order
20% off
Enter the code below at checkout to get 20% off your first order
Discover summer reading lists for all ages & interests!
Find Your Next Read

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.
Bjn Kjos-Hanssen, University of Hawaii at Manoa, USA.
Thanks for subscribing!
This email has been registered!
Take 20% off your first order
Enter the code below at checkout to get 20% off your first order