• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Automatic Complexity: A Computable Measure of Irregularity

Automatic Complexity: A Computable Measure of Irregularity

Hardcover

Series: de Gruyter Logic and Its Applications, Book 12

FictionGeneral ComputersGeneral Mathematics

ISBN10: 311077481X
ISBN13: 9783110774818
Publisher: De Gruyter
Published: Feb 19 2024
Pages: 156
Weight: 1.00
Height: 0.44 Width: 6.69 Depth: 9.61
Language: English

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.

Also in

General Computers