Delivery included to the United States

Automatic Complexity

Automatic Complexity A Computable Measure of Irregularity - De Gruyter Series in Logic and Its Applications

Hardback (05 Feb 2024)

  • $211.31
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7-10 days

Publisher's Synopsis

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.

Book information

ISBN: 9783110774818
Publisher: De Gruyter
Imprint: De Gruyter
Pub date:
DEWEY: 511.3
DEWEY edition: 23
Language: English
Number of pages: 156
Weight: 394g
Height: 240mm
Width: 170mm
Spine width: 11mm