Automatic Complexity
A Computable Measure of Irregularity
1st Edition
Published on 19. February 2024
XII, 144 pages
978-3-11-077487-0 (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
Other editions
Additional editions
E-Book
02/2024
1st Edition
De Gruyter
€184.95
Available for download
Book
02/2024
1st Edition
De Gruyter
€184.95
Shipment within 5-7 days
Person
Bjørn Kjos-Hanssen , University of Hawaii at Manoa, USA.
Content
- Intro
- Preface
- Acknowledgments
- Contents
- 1 First steps in automatic complexity
- 2 Nondeterminism and overlap-free words
- 3 Edge complexity and digraphs
- 4 The many variants
- 5 The incompressibility theorem
- 6 Conditional automatic complexity
- 7 Logical depth and automatic complexity
- Bibliography
- Index
