Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic): Series Number 48 - Image 1

£100.82

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

Name: Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic): Series Number 48
Brand: Cambridge University Press
Price: 100.82 GBP
Availability: InStock

Higher Education

About as cheap as it gets. The only time it was cheaper was 1 month ago.

£101 today · all-time low £99 (Jul 2026) · usually the usual

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 History & Forecast

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

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

Historical

Generating forecast…

Price Distribution

Price distribution over 49 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £102 (31 days, 63.3%)

Price range: £99 - £102

Price levels: 4 different prices over 49 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

Brand: Cambridge University Press
Format: hardcover
ASIN: 110841558X
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Education > Higher Education
Domain: Amazon UK
Release Date: 06 December 2018
Listed Since: 16 August 2018

Barcode

No barcode data available

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

About as cheap as it gets. The only time it was cheaper was 1 month ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

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)

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

Cambridge Logical Foundations of Proof Complexity Book

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

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

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

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

Theories of Computability

Abductive Inference: Computation, Philosophy, Technology

Cambridge Mathematics of Logic - Completeness Theorems Guide

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

Logics for Computer Science: Classical and Non-Classical

Structural Proof Theory

Automatic Sequences: Theory, Applications, Generalizations

An Introduction to Formal Languages and Machine Computation

Super-Recursive Algorithms (Monographs in Computer Science)

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

The Foundations of Computability Theory

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

Programming with Higher-Order Logic

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

Cambridge University Press - Structural Proof Theory Book

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

Algorithmic Graph Theory