Get Free Shipping on orders over $0
Automatic Complexity : A Computable Measure of Irregularity - Bjørn Kjos-Hanssen

Automatic Complexity

A Computable Measure of Irregularity

By: Bjørn Kjos-Hanssen

Hardcover | 5 February 2024

At a Glance

Hardcover


$274.47

or 4 interest-free payments of $68.62 with

 or 

Ships in 5 to 7 business days

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.

Automatic complexity is a computable and visual form of Kolmogorov complexity. Introduced by Shallit and Wang in 2001, it replaces Turing machines by finite automata, and has connections to normalized information distance, logical depth, and linear diophantine equations. Automatic Complexity is the first book on the subject and includes exercises with solutions written for the proof assistant Lean, computer programs to calculate automatic complexity, and many open problems.

More in Philosophy & Logic

Rationality : What It Is, Why It Seems Scarce, Why It Matters - Steven Pinker
The Logic of Scientific Discovery : Routledge Classics - Karl Popper
Inductive Probability : Routledge Revivals - J. P. Day
Probability, Objectivity and Evidence : Routledge Revivals - F. C. Benenson
Aristotle's Organon in Old and New Logic : 1800-1950 - Colin Guthrie  King

RRP $170.00

$141.75

17%
OFF
Philosophy of Language : A Contemporary Introduction - William G. Lycan
Philosophy of Language : A Contemporary Introduction - William G. Lycan

RRP $305.00

$263.75

14%
OFF
Philosophy and the Human Sciences - R.J. Anderson

RRP $210.00

$184.75

12%
OFF
Analogy and Exemplary Reasoning in Legal Discourse - Hendrik Kaptein
Rationality : Psychological and Philosophical Perspectives - K. I. Manktelow
Logic For Dummies : For Dummies - Mark Zegarelli

RRP $41.95

$29.37

30%
OFF