We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£131.50
It has never been this cheap. We have no record of a lower price.
£132 today · cheaper than every other day in the last 3 months
Springer - Algorithmic Randomness and Complexity: 0 Book
We'll watch every seller, every day. One email when your price arrives.
Price History & Forecast
Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.
Last 25 days · 25 data points (no recent data)
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 Distribution
Price distribution over 25 days • 1 price levels
Price Analysis
Most common price: £132 (25 days, 100.0%)
Price range: £132 - £132
Price levels: 1 different prices over 25 days
Description
Key Features
This Springer publication is part of the Theory and Applications of Computability series.
The text uses tools from computability theory and algorithmic information theory to address mathematical questions.
It examines the relationship between randomness and computational power in mathematical objects.
The book provides analysis on why specific sequences appear random compared to others through a mathematical lens.
Product Specifications
- Brand
- Springer
- Format
- hardcover
- ASIN
- 0387955674
- Domain
- Amazon UK
- Release Date
- 05 November 2010
- Listed Since
- 28 December 2006
Barcode
No barcode data available
Similar Products You Might Like
Computability and Randomness: 51 (Oxford Logic Guides)
Oxford University Press
Algorithmic Randomness: Progress and Prospects (Lecture Notes in Logic): 50 (Lecture Notes in Logic, Series Number 50)
Cambridge University Press
Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)
Elsevier
Exploring RANDOMNESS: Studien Zur Philosophie Im Deutschsprachigen Raum 1830-1930 (Discrete Mathematics and Theoretical Computer Science)
Springer
Chapman Hall/CRC Computability Theory Mathematics Book
Chapman and Hall/CRC
Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)
Wiley
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
Selected Papers Of John H. Holland: A Pioneer In Complexity Science: 4 (Exploring Complexity)
Scientific Publishing
Reverse Mathematics: Problems, Reductions, and Proofs
Springer
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Springer
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)
Springer
What Can Be Computed?: A Practical Guide to the Theory of Computation
Princeton University Press
THINKING ABOUT GODEL AND TURING: ESSAYS ON COMPLEXITY, 1970-2007
World Scientific Publishing Company
The Foundations of Computability Theory
Springer
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday: 6300 (Lecture Notes in Computer Science, 6300)
Springer
Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)
Springer
Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)
Birkhauser
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)
Springer
Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)
CRC Press
Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
Springer
Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures
Springer