£114.00

Cambridge University Press Theories of Computability

Name: Theories of Computability
Brand: Cambridge University Press
Price: 114.0 GBP
Availability: InStock

Access

Cheaper than 43% of the days we've watched it. Below what most people pay.

£114 today · 30-day average £119 · all-time low £107

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 84 days · 84 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 84 days • 6 price levels

Days at Price

Current Price

Price Analysis

Most common price: £120 (28 days, 33.3%)

Price range: £107 - £120

Price levels: 6 different prices over 84 days

Description

This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521553806
Category: Books > Subjects > Computing & Internet > Microsoft Windows > Microsoft > Access
Domain: Amazon UK
Release Date: 28 May 1997
Listed Since: 22 January 2007

Barcode

No barcode data available

Cambridge University Press Theories of Computability

Cheaper than 43% of the days we've watched it. Below what most people pay.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Foundations of Computability Theory

An Introduction to Formal Languages and Machine Computation

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

New Computational Paradigms: Changing Conceptions of What is Computable

Turing’s Revolution: The Impact of His Ideas about Computability

Turing’s Revolution: The Impact of His Ideas about Computability

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

Logical Foundations of Proof Complexity (Perspectives in Logic)

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

Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)

Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationship: 23 (Cambridge Tracts in Theoretical Computer Science, Series Number 23)

Algorithmic Graph Theory

Handbook of Computability Theory (Volume 140) (Studies in Logic and the Foundations of Mathematics, Volume 140)

Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)

Computational Semantics with Functional Programming

Automatic Sequences: Theory, Applications, Generalizations

Noncommutative Rational Series with Applications: 137 (Encyclopedia of Mathematics and its Applications, Series Number 137)

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)

Concurrency Theory: Calculi an Automata for Modelling Untimed and Timed Concurrent Systems

Computation, Proof, Machine: Mathematics Enters a New Age

P, Np, and Np-Completeness: The Basics of Computational Complexity

Combinatorics, Automata and Number Theory: 135 (Encyclopedia of Mathematics and its Applications, Series Number 135)

The Formal Semantics of Programming Languages: An Introduction (Foundations of Computing)

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