Computability: An Introduction to Recursive Function Theory - Image 1

£50.51

Cambridge University Press Computability: An Introduction to Recursive Function Theory

Name: Computability: An Introduction to Recursive Function Theory
Brand: Cambridge University Press
Price: 50.51 GBP
Availability: InStock

Pink

Languages

This is the usual price. Wait for it to drop, or tell us your number.

£51 today · usual range £0–£0 · best ever £39

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 584 days • 584 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 584 days • 9 price levels

Days at Price

Current Price

Price Analysis

Most common price: £49 (279 days, 47.8%)

Price range: £39 - £53

Price levels: 9 different prices over 584 days

Description

What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as Gödel's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.

Product Specifications

Brand: Cambridge University Press
Colour: Pink
Format: paperback
ASIN: 0521294657
Category: Books > Subjects > Computing & Internet > Programming > Languages
Domain: Amazon UK
Release Date: 19 June 1980
Listed Since: 15 February 2007

Barcode

No barcode data available

Cambridge University Press Computability: An Introduction to Recursive Function Theory

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computability Theory: An Introduction to Recursion Theory

Computability

Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

Computability and Logic

Theory of Computation

Introduction to Metamathematics (Bibliotheca Mathematica)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)

Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)

Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computability In Context: Computation And Logic In The Real World

What Can Be Computed? – A Practical Guide to the Theory of Computation

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Volume 125 (Studies in Logic and the Foundations of Mathematics, Volume 125)

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Cambridge Higher Recursion Theory 2 - Perspectives in Logic

A Programming Approach to Computability (Monographs in Computer Science)

Programs as Diagrams: From Categorical Computability to Computable Categories (Theory and Applications of Computability)

COMPUTATIONAL PROSPECTS OF INFINITY - PART II: PRESENTED TALKS: 15 (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Higher-Order Computability (Theory and Applications of Computability)

Springer Higher-Order Computability Theory and Applications