Automatic Complexity : : A Computable Measure of Irregularity / / Bjørn Kjos-Hanssen.
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 fee...
Saved in:
| VerfasserIn: | |
|---|---|
| Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2024] 2024 |
| Year of Publication: | 2024 |
| Language: | English |
| Series: | De Gruyter Series in Logic and Its Applications ,
12 |
| Online Access: | |
| Physical Description: | 1 online resource (XII, 144 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!