**Algorithmic Randomness and Complexity**

by R. G. Downey, D. R. Hirschfeldt

**Publisher**: Springer 2010**ISBN/ASIN**: 0387955674**ISBN-13**: 9780387955674**Number of pages**: 629

**Description**:

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.

Download or read it online for free here:

**Download link**

(4MB, PDF)

## Similar books

**Introduction to Complexity Theory**

by

**Oded Goldreich**

Complexity theory is the study of the intrinsic complexity of computational tasks. The book is aimed at exposing the students to the basic results and research directions in the field. The focus was on concepts, complex technical proofs were avoided.

(

**5282**views)

**From Complexity to Creativity**

by

**Ben Goertzel**-

**Plenum Press**

This text applies the concepts of complexity science to provide an explanation of all aspects of human creativity. The book describes the model that integrates ideas from computer science, mathematics, neurobiology, philosophy, and psychology.

(

**9105**views)

**Around Kolmogorov Complexity: Basic Notions and Results**

by

**Alexander Shen**-

**arXiv.org**

Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.

(

**403**views)

**Measure-Preserving Systems**

by

**Karl Petersen**-

**University of North Carolina**

These notes provide an introduction to the subject of measure-preserving dynamical systems, discussing the dynamical viewpoint; how and from where measure-preserving systems arise; the construction of measures and invariant measures; etc.

(

**5794**views)