Spar
Automatic Complexity
Forfatter:
innbundet, 2024
Engelsk
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.
- Undertittel
- A Computable Measure of Irregularity
- Forfatter
- Bjørn Kjos-Hanssen
- ISBN
- 9783110774818
- Språk
- Engelsk
- Vekt
- 394 gram
- Utgivelsesdato
- 19.2.2024
- Forlag
- De Gruyter
- Antall sider
- 156
