Computability: An Introduction to Recursive Function Theory - Image 1

Price loading...

Cambridge University Press Computability: An Introduction to Recursive Function Theory

Name: Computability: An Introduction to Recursive Function Theory
Brand: Cambridge University Press

Pink

Languages

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

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

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

Computability Theory: An Introduction to Recursion Theory

Computability

Theory of Computation

The Foundations of Computability Theory

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Automata and Computability

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

Computational Complexity: A Conceptual Perspective

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

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

Automata and Computability (Undergraduate Texts in Computer Science)

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

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

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

Computability In Context: Computation And Logic In The Real World

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

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

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability)

Mathematics in Programming

Introduction to Incompleteness: From Gödel's Theorems to Forcing and the Continuum Hypothesis

Introduction to Coalgebra: Towards Mathematics of States and Observation: 59 (Cambridge Tracts in Theoretical Computer Science, Series Number 59)