Automatic Complexity

Bjørn Kjos-Hanssen

E-Book (epub)

(0)

Erste Bewertung abgeben

Automatic Complexity discusses a treatment of a computable form of Kolmogorov complexity, in which Turing machines are replaced b...

CHF163.90

Download steht sofort bereit

E-Book (epub)

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.

Autorentext

Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.