{
"item_title" : "Automatic Complexity",
"item_author" : [" Bjørn Kjos-Hanssen "],
"item_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. ",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/11/077/481/311077481X_b.jpg",
"price_data" : {
"retail_price" : "210.00", "online_price" : "210.00", "our_price" : "210.00", "club_price" : "210.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Automatic Complexity : A Computable Measure of Irregularity
Overview
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.
This item is Non-Returnable
Customers Also Bought
- 1
Details
- ISBN-13: 9783110774818
- ISBN-10: 311077481X
- Publisher: de Gruyter
- Publish Date: February 2024
- Dimensions: 9.61 x 6.69 x 0.44 inches
- Shipping Weight: 1 pounds
- Page Count: 156
Related Categories
You May Also Like...
- 1
