Automatic Complexity
A Computable Measure of Irregularity
E-bok
Engelska, 20242 197 kr
Läs direkt i Bokus Reader – eller ladda ned till din enhet
Fler format och utgåvor
Beskrivning
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.
Produktinformation
Utforska kategorier
Hoppa över listan
Du kanske också är intresserad av
- Signerad!
- Signerad!
- -30%
Del 1
- -19%
- 4 för 3
Del 14
- -23%
- 4 för 3
Del 11
- -23%