E-bok, Engelska, 2024
Automatic Complexity
A Computable Measure of Irregularity
2308 kr
Läs direkt i Bokus Reader – eller ladda ned till din enhet (PDF kräver ofta zoom och scroll på små skärmar).
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
- Utgivningsdatum: 2024-02-19
- Språk: Engelska
- Filformat: PDF
- Kopieringsskydd: LCP
- ISBN: 9783110774870
- Förlag: De Gruyter
Utforska kategorier
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.