Automatic Complexity
A Computable Measure of Irregularity
Inbunden, Engelska, 2024
Del i serien De Gruyter Series in Logic & its Applications
2 253 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.
Beskrivning
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.
