click to view more
Automatic Complexity: A Computable Measure of Irregularity
by Kjos-Hanssen, Bjørn
$195.81
List Price: $195.99
Save: $0.18 (0%)
Description
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.
Last updated on
Product Details
- Feb 19, 2024 Pub Date:
- 311077481X ISBN-10:
- 9783110774818 ISBN-13:
- English Language
Money Back
Love it! Use it! Reuse it!
Free Shipping
Shipping is on us
Free Support
24/24 available
