We can't find the internet
Attempting to reconnect
Something went wrong!
Hang in there while we get back on track
£53.35
Oxford University Press Computability and Randomness: 51 (Oxford Logic Guides)
Price data last checked 152 day(s) ago - refreshing...
We'll watch every seller, every day. One email when your price arrives.
This is the usual price. Wait for it to drop, or tell us your number.
£53 today · usual range £0–£0 · best ever £47
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
when this has been cheap or pricey
where the price is heading next
all-time high & low, recent range
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 579 days • 579 data points (No recent data available)
Price Distribution
Price distribution over 579 days • 6 price levels
Price Analysis
Most common price: £53 (237 days, 40.9%)
Price range: £47 - £56
Price levels: 6 different prices over 579 days
Description
Product Specifications
- Brand
- Oxford University Press
- Format
- paperback
- ASIN
- 0199652600
- Domain
- Amazon UK
- Publication Date
- 29 March 2012
- Listed Since
- 21 September 2011
Barcode
No barcode data available
Similar Products You Might Like
Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)
Springer
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)
De Gruyter
Kolmogorov Complexity and Algorithmic Randomness - AMS Book
Kolmogorov Complexity and Algorithmic Randomness (Mathematical Surveys and Monographs)
Structure and Randomness in Computability and Set Theory
World Scientific Publishing Company
Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)
Cambridge University Press
Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)
Birkhauser
Algorithmic Randomness: Progress and Prospects: 50 (Lecture Notes in Logic, Series Number 50)
Cambridge University Press
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
Cambridge University Press
Combinatorics: Topics, Techniques, Algorithms
Cambridge University Press
Information, Randomness And Incompleteness: Papers On Algorithmic Information Theory: 8 (World Scientific Series In Computer Science)
World Scientific Publishing Company
Probability And Random Number: A First Guide To Randomness
World Scientific Publishing Company
The Nature of Computation
Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)
CRC Press
Computational Complexity: A Modern Approach
Cambridge University Press
Stochastic Relations: Foundations for Markov Transition Systems (Chapman & Hall/CRC Studies in Informatics Series)
CRC Press
Computability and Logic
Cambridge University Press
Stochastic Coalgebraic Logic (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Connecting Discrete Mathematics and Computer Science (Law in Context)
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)
Springer
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
Springer
The Mathematics of Paul Erdős II
Springer
Aspects of Kolmogorov Complexity the Physics of Information (River Publishers Series in Information Science and Technology)
Taylor & Francis
An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)
Springer