Automatic Complexity
A Computable Measure of Irregularity
Format:Hardback
Publisher:De Gruyter
Published:19th Feb '24
Currently unavailable, currently targeted to be due back around 26th December 2025, but could change
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.
ISBN: 9783110774818
Dimensions: unknown
Weight: 394g
156 pages