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

£131.50

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

Name: Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)
Brand: Springer
Price: 131.5 GBP
Availability: InStock

Mathematical Logic

This is the most expensive it has ever been. Walk away.

£132 today · previous high £132 · all-time low £120

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 52 days · 52 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 52 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £132 (27 days, 51.9%)

Price range: £120 - £132

Price levels: 2 different prices over 52 days

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 > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
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)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computability and Randomness: 51 (Oxford Logic Guides)

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

Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

Exploring RANDOMNESS: Studien Zur Philosophie Im Deutschsprachigen Raum 1830-1930 (Discrete Mathematics and Theoretical Computer Science)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

Selected Papers Of John H. Holland: A Pioneer In Complexity Science: 4 (Exploring Complexity)

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Turing Computability: Theory and Applications (Theory and Applications of Computability)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

What Can Be Computed? – A Practical Guide to the Theory of Computation

THINKING ABOUT GODEL AND TURING: ESSAYS ON COMPLEXITY, 1970-2007

The Foundations of Computability Theory

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday: 6300 (Lecture Notes in Computer Science, 6300)

Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Ultrafilters Across Mathematics (Contemporary Mathematics): International Congress Ultramath 2008: Applications of Ultrafilters and Ultraproducts in Mathematics, June 1-7, 2008, Pisa, Italy

Samson Abramsky on Logic and Structure in Computer Science and Beyond: 25 (Outstanding Contributions to Logic, 25)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

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

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures