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.
1144259197
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.
195.99
In Stock
5
1
Automatic Complexity: A Computable Measure of Irregularity
156
Automatic Complexity: A Computable Measure of Irregularity
156
195.99
In Stock
Product Details
| ISBN-13: | 9783110774818 |
|---|---|
| Publisher: | De Gruyter |
| Publication date: | 02/19/2024 |
| Series: | De Gruyter Series in Logic and Its Applications , #12 |
| Pages: | 156 |
| Product dimensions: | 6.69(w) x 9.45(h) x (d) |
| Age Range: | 18 Years |
About the Author
From the B&N Reads Blog