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 - Princeton University Press
Price data last checked 15 day(s) ago - will refresh soon
Price History & Forecast
Last 76 days • 76 data points (No recent data available)
Price Distribution
Price distribution over 76 days • 1 price levels
Price Analysis
Most common price: £80 (76 days, 100.0%)
Price range: £80 - £80
Price levels: 1 different prices over 76 days
Description
Key Features
Introduces a new hierarchy to classify the combinatorics of constructions within various areas of computability theory.
Provides a unifying framework for studying algorithmic randomness, Turing degrees, and effectively closed sets.
Explores the growing connections between computability theory and mathematical subfields like topology and group theory.
Part of the prestigious Annals of Mathematics Studies series, volume 206, from Princeton University Press.
Offers specialized insights into effective structure theory and the computably enumerable degrees.
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)
The Foundations of Computability Theory
Springer
Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)
Chapman and Hall/CRC
Computability Theory: An Introduction to Recursion Theory
Academic Press
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Springer
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Computability
Springer
Apartness and Uniformity: A Constructive Development (Theory and Applications of Computability)
Springer
What Can Be Computed? – A Practical Guide to the Theory of Computation
Princeton University Press
COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)
Scientific Publishing
Computable Structure Theory: Within the Arithmetic (Perspectives in Logic)
Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)
Springer
Theory of Computation: Automata, Formal Languages, Computation and Complexity
Springer
Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)
Computability: An Introduction to Recursive Function Theory
Cambridge University Press
Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)
Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Introduction to Ramsey Spaces (AM-174) (Annals of Mathematics Studies)
Princeton University Press
Distributed Computing Through Combinatorial Topology
Morgan Kaufmann
Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)
Cambridge University Press
Automata and Computability
Springer
Theory of Computation
Wiley
Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)
Springer
Language Computability and Formal Language Theory
Society Publishing