122,95 €
122,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
61 °P sammeln
122,95 €
122,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
61 °P sammeln
Als Download kaufen
122,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
61 °P sammeln
Jetzt verschenken
122,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
61 °P sammeln
  • Format: ePub

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.

Produktbeschreibung
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.


Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

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