Automatic Complexity
A Computable Measure of Irregularity
1st Edition
Published on 19. February 2024
Book
Hardback
XII, 144 pages
978-3-11-077481-8 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Berlin/Boston
Germany
Target group
Professional and scholarly
US School Grade: College Graduate Student
Illustrations
5 farbige Abbildungen, 7 s/w Tabellen, 9 s/w Abbildungen
9 b/w and 5 col. ill., 7 b/w tbl.
Dimensions
Height: 24 cm
Width: 17 cm
Weight
394 gr
ISBN-13
978-3-11-077481-8 (9783110774818)
Schweitzer Classification
Other editions
Additional editions
E-Book
02/2024
1st Edition
De Gruyter
€174.95
Available for download
E-Book
02/2024
1st Edition
De Gruyter
€184.95
Available for download
Person
Bjørn Kjos-Hanssen , University of Hawaii at Manoa, USA.