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: Parallel Complexity TheoryParallel Complexity Theory
by - Prentice Hall
The rapid growth of parallel complexity theory has led to a proliferation of parallel machine models. This book presents a unified theory of parallel computation based on a network model. It is the first such synthesis in book form.
(7561 views)
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.
(8936 views)
Book cover: Think Complexity: Complexity Science and Computational ModelingThink Complexity: Complexity Science and Computational Modeling
by - Green Tea Press
This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. The book focuses on discrete models, which include graphs, cellular automata, and agent-based models.
(7578 views)
Book cover: Specifying SystemsSpecifying Systems
by - Addison-Wesley Professional
This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.
(13002 views)