Automatic Complexity
A Computable Measure of Irregularity
(Sprache: Englisch)
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,...
lieferbar
versandkostenfrei
Buch (Gebunden)
159.95 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Automatic Complexity “
Klappentext zu „Automatic Complexity “
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.
Autoren-Porträt von Bjørn Kjos-Hanssen
Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.
Bibliographische Angaben
- Autor: Bjørn Kjos-Hanssen
- 2024, XII, 144 Seiten, 9 Schwarz-Weiß-Abbildungen, Maße: 18,1 x 24,5 cm, Gebunden, Englisch
- Verlag: De Gruyter
- ISBN-10: 311077481X
- ISBN-13: 9783110774818
Sprache:
Englisch
Kommentar zu "Automatic Complexity"
Schreiben Sie einen Kommentar zu "Automatic Complexity".
Kommentar verfassen