Automatic Complexity / De Gruyter Series in Logic and Its Applications Bd.12 (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...
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
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.
Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.
- Autor: Bjørn Kjos-Hanssen
- 2024, 156 Seiten, Englisch
- Verlag: Walter de Gruyter
- ISBN-10: 3110774909
- ISBN-13: 9783110774900
- Erscheinungsdatum: 19.02.2024
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: ePub
- Größe: 16 MB
- Ohne Kopierschutz
Schreiben Sie einen Kommentar zu "Automatic Complexity / De Gruyter Series in Logic and Its Applications Bd.12".
Kommentar verfassen