£101.19

About as cheap as it gets — within 5% of the all-time low it hit 1 month ago.

£101 today · all-time low £97 (Oct 2026) · usually £100

Cambridge University Press Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic): Series Number 48

View at Amazon

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 81 days · 81 data points (no recent data)

Historical
Generating forecast…
£102.34 £96.35 £97.65 £98.96 £100.27 £101.58 £102.89 11 August 2026 31 August 2026 20 September 2026 10 October 2026 30 October 2026
View at Amazon ↗

Price data last checked 10 day(s) ago - will refresh soon

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 Distribution

Price distribution over 81 days • 4 price levels

Days at Price
Current Price
3 days 8 days 12 days · current 58 days 0 15 29 44 58 £97 £99 £101 £102 Days at Price

Price Analysis

Most common price: £102 (58 days, 71.6%)

Price range: £97 - £102

Price levels: 4 different prices over 81 days

Description

This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.

Product Specifications

Format
hardcover
Domain
Amazon UK
Release Date
06 December 2018
Listed Since
16 August 2018

Barcode

No barcode data available

Similar Products You Might Like

LMS: 45 Recursion Theory, Applns: Its Generalisations & Applications, Proceedings of Logic Colloquim '79, Leeds, Aug. 1979 (London Mathematical Society Lecture Note Series, Series Number 45)
83% match

LMS: 45 Recursion Theory, Applns: Its Generalisations & Applications, Proceedings of Logic Colloquim '79, Leeds, Aug. 1979 (London Mathematical Society Lecture Note Series, Series Number 45)

Cambridge University Press

£76.00 24 Oct 2026
Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)
83% match

Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Cambridge University Press

£133.49 23 Oct 2026
Cambridge Logical Foundations of Proof Complexity Book
82% match

Cambridge Logical Foundations of Proof Complexity Book

Cambridge University Press

£96.31 09 Nov 2026
Lectures in Logic and Set Theory: Volume 2, Set Theory: 83 (Cambridge Studies in Advanced Mathematics, Series Number 83)
81% match

Lectures in Logic and Set Theory: Volume 2, Set Theory: 83 (Cambridge Studies in Advanced Mathematics, Series Number 83)

Cambridge University Press

£157.99 18 Oct 2026
Forcing with Random Variables and Proof Complexity: 382 (London Mathematical Society Lecture Note Series, Series Number 382)
81% match

Forcing with Random Variables and Proof Complexity: 382 (London Mathematical Society Lecture Note Series, Series Number 382)

Cambridge University Press

£55.99 16 Oct 2026
Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)
80% match

Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)

Birkhauser

£76.42 23 Oct 2026
Recursion: Complexity in Cognition: 43 (Studies in Theoretical Psycholinguistics, 43)
80% match

Recursion: Complexity in Cognition: 43 (Studies in Theoretical Psycholinguistics, 43)

Springer

£60.08 24 Oct 2026
Theories of Computability
80% match

Theories of Computability

Cambridge University Press

£114.00 30 Aug 2026
Abductive Inference: Computation, Philosophy, Technology
80% match

Abductive Inference: Computation, Philosophy, Technology

Cambridge University Press

£99.00 12 Oct 2026
Cambridge Mathematics of Logic - Completeness Theorems Guide
79% match

Cambridge Mathematics of Logic - Completeness Theorems Guide

Cambridge University Press

£41.02 24 Aug 2026
Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
79% match

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Springer

£44.99 31 Oct 2026
Logics for Computer Science: Classical and Non-Classical
79% match

Logics for Computer Science: Classical and Non-Classical

Springer

£81.34 26 Oct 2026
Structural Proof Theory
79% match

Structural Proof Theory

Cambridge University Press

£94.00 26 Oct 2026
Automatic Sequences: Theory, Applications, Generalizations
79% match

Automatic Sequences: Theory, Applications, Generalizations

Cambridge University Press

£23.60 28 Oct 2026
An Introduction to Formal Languages and Machine Computation
79% match

An Introduction to Formal Languages and Machine Computation

Scientific Publishing

£68.00 12 Sep 2026
Super-Recursive Algorithms (Monographs in Computer Science)
79% match

Super-Recursive Algorithms (Monographs in Computer Science)

Springer

£76.42 23 Oct 2026
Complexity: Knots, Colourings and Countings: 186 (London Mathematical Society Lecture Note Series, Series Number 186)
79% match

Complexity: Knots, Colourings and Countings: 186 (London Mathematical Society Lecture Note Series, Series Number 186)

Cambridge University Press

£60.00 24 Oct 2026
The Foundations of Computability Theory
78% match

The Foundations of Computability Theory

Springer

£73.46 26 Oct 2026
Advanced Topics in Bisimulation and Coinduction: 52 (Cambridge Tracts in Theoretical Computer Science, Series Number 52)
78% match

Advanced Topics in Bisimulation and Coinduction: 52 (Cambridge Tracts in Theoretical Computer Science, Series Number 52)

Cambridge University Press

£93.24 21 Oct 2026
Programming with Higher-Order Logic
78% match

Programming with Higher-Order Logic

Cambridge University Press

£41.77 23 Oct 2026
Computability and Models: Perspectives East and West (University Series in Mathematics)
78% match

Computability and Models: Perspectives East and West (University Series in Mathematics)

Springer

£76.42 23 Oct 2026
Cambridge University Press - Structural Proof Theory Book
78% match

Cambridge University Press - Structural Proof Theory Book

Cambridge University Press

£38.81 17 Oct 2026
Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ... (Lecture Notes in Computer Science, 1893)
78% match

Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ... (Lecture Notes in Computer Science, 1893)

Springer

£84.46 16 Oct 2026
Algorithmic Graph Theory
78% match

Algorithmic Graph Theory

Cambridge University Press

£44.99 20 Oct 2026