We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£79.58
Princeton University Press A Hierarchy of Turing Degrees - Computability Theory Book
Price data checked 6 days ago
We'll watch every seller, every day. One email when your price arrives.
It has never been this cheap. We have no record of a lower price.
£80 today · cheaper than every other day in the last 3 months
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 85 days · 85 data points (no recent data)
Price Distribution
Price distribution over 85 days • 2 price levels
Price Analysis
Most common price: £80 (68 days, 80.0%)
Price range: £80 - £136
Price levels: 2 different prices over 85 days
Description
Key Features
Introduces a new unifying hierarchy for classifying constructions in computability theory and algorithmic randomness.
Covers Turing degrees, effectively closed sets, and effective structure theory with comprehensive mathematical rigor.
Demonstrates connections between computability theory and other mathematical disciplines including topology and group theory.
Published by Princeton University Press as volume 206 in the Annals of Mathematics Studies series.
Authored by Rod Downey and Noam Greenberg, leading experts in computability theory and mathematical logic.
Product Specifications
- Format
- hardcover
- ASIN
- 0691199655
- Domain
- Amazon UK
- Release Date
- 16 June 2020
- Listed Since
- 22 October 2019
Barcode
No barcode data available
Similar Products You Might Like
Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Springer
Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)
Cambridge University Press
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
Computability and Logic
Cambridge University Press
Springer - Computational Artifacts Philosophy of Computer Science
Springer
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)
Cambridge University Press
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
Computability
Springer
Computability Theory: An Introduction to Recursion Theory
Elsevier
Computability In Context: Computation And Logic In The Real World
Imperial College Press
COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (LECTURE NOTES SERIES, INSTITUTE FOR MATHEMATICAL SCIENCES, NATIONAL UNIVERSITY OF SINGAPORE)
Scientific Publishing
Algebra, Meaning, and Computation: Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday: 4060 (Lecture Notes in Computer Science, 4060)
Springer
Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)
Springer
Introduction to Metamathematics (Bibliotheca Mathematica)
North Holland
Computational Logic: 165 (NATO ASI Subseries F:, 165)
Springer
Theory of Computation
Wiley
Functional Interpretations: From the Dialectica Interpretation to Functional Interpretations of Analysis and Set Theory
World Scientific Publishing Company