Computability and Randomness: 51 (Oxford Logic Guides) - Image 1

£54.73

Oxford University Press Computability and Randomness: 51 (Oxford Logic Guides)

Name: Computability and Randomness: 51 (Oxford Logic Guides)
Brand: Oxford University Press
Price: 54.73 GBP
Availability: InStock

Set Theory

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£55 today · all-time low £53 (Apr 2026) · usually the usual

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 48 days · 48 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 48 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £55 (37 days, 77.1%)

Price range: £53 - £55

Price levels: 2 different prices over 48 days

Description

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory. The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.

Product Specifications

Brand: Oxford University Press
Format: paperback
ASIN: 0199652600
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Set Theory
Domain: Amazon UK
Release Date: 29 March 2012
Listed Since: 21 September 2011

Barcode

No barcode data available

Oxford University Press Computability and Randomness: 51 (Oxford Logic Guides)

About as cheap as it gets. The only time it was cheaper was 3 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

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

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Kolmogorov Complexity and Algorithmic Randomness - AMS Book

Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)

Structure and Randomness in Computability and Set Theory

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

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

Lectures in Logic and Set Theory: Volume 1, Mathematical Logic (Cambridge Studies in Advanced Mathematics, Series Number 82)

40 Puzzles and Problems in Probability and Mathematical Statistics (Problem Books in Mathematics)

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

Combinatorics: Topics, Techniques, Algorithms

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

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

Springer - Patterns in Permutations and Words Book

Probability And Random Number: A First Guide To Randomness

The Nature of Computation

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

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

Computational Complexity: A Modern Approach

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

Stochastic Relations: Foundations for Markov Transition Systems (Chapman & Hall/CRC Studies in Informatics Series)