Automatic Complexity : : A Computable Measure of Irregularity / / Bjørn Kjos-Hanssen.
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 fee...
Saved in:
VerfasserIn: | |
---|---|
Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2024] 2024 |
Year of Publication: | 2024 |
Language: | English |
Series: | De Gruyter Series in Logic and Its Applications ,
12 |
Online Access: | |
Physical Description: | 1 online resource (XII, 144 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Applicable law in investor-state arbitration : : the interplay between national and international law / / Hege Elisabeth Kjos.
by: Kjos, Hege Elisabeth.
Published: (2013.) -
Women, religion, and the body in South Asia : : living with Bengali Bauls / / Kristin Hanssen.
by: Hanssen, Kristin,
Published: (2018.) -
Fin de siecle Beirut : : the making of an Ottoman provincial capital / / Jens Hanssen.
by: Hanssen, Jens,
Published: (2005.) -
Programmable logic controllers : : a practical approach to IEC 61131-3 using CODESYS / / Dag H. Hanssen ; translated by Dan Lufkin.
by: Hanssen, Dag Hakon,
Published: (2015.) -
An automatic impedance meter / by Hans Werthén and Björn Nilsson
by: Werthén, Hans
Published: (1947)