Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability) - Image 1

Price loading...

Springer Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Name: Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)
Brand: Springer

Algorithms

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

Description

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another? And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 0387955674
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 05 November 2010
Listed Since: 28 December 2006

Barcode

No barcode data available

Springer Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

Computability and Randomness: 51 (Oxford Logic Guides)

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Randomness And Undecidability In Physics

Aspects of Kolmogorov Complexity the Physics of Information (River Publishers Series in Information Science and Technology)

Computational Complexity: A Conceptual Perspective

Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)

The Foundations of Computability Theory

Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)

Algorithmic Randomness: Progress and Prospects: 50 (Lecture Notes in Logic, Series Number 50)

Computability Theory: An Introduction to Recursion Theory

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Theory of Random Sets (Probability and Its Applications)

Advances in Unconventional Computing: Volume 1: Theory: 22 (Emergence, Complexity and Computation, 22)

Independent Random Sampling Methods (Statistics and Computing)

Springer Computational Invariant Theory: 130 Mathematics Book

An Introduction to Random Sets

CRC Press - An Introduction to Random Sets - Mathematics Book