Free Download Automatic Complexity: A Computable Measure of Irregularity (De Gruyter Series in Logic and Its Applications, 12) by Bjørn Kjos-Hanssen
English | February 19, 2024 | ISBN: 311077481X | 156 pages | MOBI | 3.02 Mb
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.
Code:
Bitte
Anmelden
oder
Registrieren
um Code Inhalt zu sehen!
