Automatic Complexity

Beschreibung

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.

Autor*in

Bjørn Kjos-Hanssen

Themen in »Automatic Complexity«

Complexity Kolmogorov structures random words normal words Fibonacci words.

Stimmen zu »Automatic Complexity«

Details

Link teilen