Logo

Algorithmic Randomness and Complexity

Large book cover: Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity
by

Publisher: Springer
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.

Home page url

Download or read it online for free here:
Download link
(4MB, PDF)

Similar books

Book cover: Measure-Preserving SystemsMeasure-Preserving Systems
by - 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.
(11823 views)
Book cover: Introduction to Computational ComplexityIntroduction to Computational Complexity
by
Lecture notes for a graduate course on computational complexity taught at the University of Washington. Alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases.
(10772 views)
Book cover: Complexity and ComputationComplexity and Computation
by - Green Tea Press
This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science. The book covers Graphs, Analysis of algorithms, Scale-free networks, Cellular Automata, Agent-based models, etc.
(16989 views)
Book cover: Computability and Complexity from a Programming PerspectiveComputability and Complexity from a Programming Perspective
by - The MIT Press
The author builds a bridge between computability and complexity theory and other areas of computer science. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists.
(12990 views)