• Automatic Complexity
1 1

Automatic Complexity

Publisher:

$210.00
$0.00 $210.00
Sold out
The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may ...
Read More
  • 19 February 2024
View Product Details

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.

files/i.png Icon
Price: $210.00
Pages: 156
Publisher: De Gruyter
Imprint: De Gruyter
Publication Date: 19 February 2024
ISBN: 9783110774818
Format: Hardcover
BISACs: MAT000000 MATHEMATICS / General, MAT008000 MATHEMATICS / Discrete Mathematics, MAT018000 MATHEMATICS / Logic
REVIEWS Icon

Bjørn Kjos-Hanssen, University of Hawaii at Manoa, USA.