MOTHER'S DAY SPECIALS! SHOW ME MORE

Close Notification

Your cart does not contain any items

Automatic Complexity

A Computable Measure of Irregularity

Bjørn Kjos-Hanssen

$423.95   $339.34

Hardback

Not in-store but you can order this
How long will it take?

QTY:

English
De Gruyter
19 February 2024
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.
By:  
Imprint:   De Gruyter
Country of Publication:   Germany
Dimensions:   Height: 240mm,  Width: 170mm, 
Weight:   394g
ISBN:   9783110774818
ISBN 10:   311077481X
Series:   De Gruyter Series in Logic & its Applications
Pages:   156
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Hardback
Publisher's Status:   Active

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

See Also