Automatic Complexity
A Computable Measure of Irregularity
Inbunden, Engelska, 2024
2 509 kr
Beställningsvara. Skickas inom 5-8 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced by finite automata. The complexities of many types of words are studied, including random words, normal words, Fibonacci words, Thue words, and words produced by linear feedback shift registers.
Produktinformation
- Utgivningsdatum2024-02-19
- Mått170 x 240 x undefined mm
- Vikt394 g
- FormatInbunden
- SpråkEngelska
- SerieDe Gruyter Series in Logic & its Applications
- Antal sidor156
- FörlagDe Gruyter
- ISBN9783110774818