# Computability: An Introduction to Recursive Function Theory

## Nigel Cutland

Note moyenne 3,93
( 14 avis fournis par Goodreads )

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 Gildel'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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Book Description :

This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and Gödel's Incompleteness Theorem.

Review :

"Dr. Cutland has produced here an excellent and much needed textbook which will undoubtedly help to establish recursion theory as a more widely taught branch of mainstream mathematics." Mathematics & Physics

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Acheter neuf Afficher le livre
EUR 41,29

Frais de port : EUR 1,34
De Royaume-Uni vers France

Destinations, frais et délais

Ajouter au panier

## 1.Computability: An Introduction to Recursive Function Theory (Paperback)

Edité par CAMBRIDGE UNIVERSITY PRESS, United Kingdom (1980)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Paperback Quantité : 1
Vendeur
The Book Depository
(London, Royaume-Uni)
Evaluation vendeur

Description du livre CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 1980. Paperback. État : New. Language: English . Brand New Book. 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 Gildel 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. N° de réf. du libraire AAU9780521294652

Acheter neuf
EUR 41,29
Autre devise
Frais de port : EUR 1,34
De Royaume-Uni vers France
Destinations, frais et délais

## 2.Computability

Edité par Cambridge University Press 1980-06-19, Cambridge (1980)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) paperback Quantité : > 20
Vendeur
Blackwell's
(Oxford, OX, Royaume-Uni)
Evaluation vendeur

Description du livre Cambridge University Press 1980-06-19, Cambridge, 1980. paperback. État : New. N° de réf. du libraire 9780521294652

Acheter neuf
EUR 41,30
Autre devise
Frais de port : EUR 2,79
De Royaume-Uni vers France
Destinations, frais et délais

## 3.Computability: An Introduction to Recursive Function Theory (Paperback)

Edité par CAMBRIDGE UNIVERSITY PRESS, United Kingdom (1980)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Paperback Quantité : 1
Vendeur
The Book Depository US
(London, Royaume-Uni)
Evaluation vendeur

Description du livre CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 1980. Paperback. État : New. Language: English . Brand New Book. 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 Gildel 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. N° de réf. du libraire AAU9780521294652

Acheter neuf
EUR 46,10
Autre devise
Frais de port : EUR 1,34
De Royaume-Uni vers France
Destinations, frais et délais

## 4.Computability

Edité par Cambridge University Press (1980)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Couverture souple Edition originale Quantité : 1
Evaluation vendeur

Description du livre Cambridge University Press, 1980. État : New. This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's incompleteness theorem; degrees of unsolvability; the recursion theorems; and the theory of complexity of computation. Num Pages: 264 pages, 24d.1tab. BIC Classification: PBC. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 234 x 167 x 16. Weight in Grams: 402. . 1980. 1st Edition. Paperback. . . . . . N° de réf. du libraire V9780521294652

Acheter neuf
EUR 48,08
Autre devise
Frais de port : Gratuit
De Irlande vers France
Destinations, frais et délais

## 5.Computability: An Introduction to Recursive Function Theory

Edité par Cambridge University Press 1980-06 (1980)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Quantité : 5
impression à la demande
Vendeur
Chiron Media
(Wallingford, Royaume-Uni)
Evaluation vendeur

Description du livre Cambridge University Press 1980-06, 1980. État : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du libraire NU-LSI-06850463

Acheter neuf
EUR 45,44
Autre devise
Frais de port : EUR 3,33
De Royaume-Uni vers France
Destinations, frais et délais

## 6.Computability

Edité par Cambridge University Press
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Couverture souple Quantité : 1
Vendeur
Kennys Bookstore
(Olney, MD, Etats-Unis)
Evaluation vendeur

Description du livre Cambridge University Press. État : New. This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's incompleteness theorem; degrees of unsolvability; the recursion theorems; and the theory of complexity of computation. Num Pages: 264 pages, 24d.1tab. BIC Classification: PBC. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 234 x 167 x 16. Weight in Grams: 402. . 1980. 1st Edition. Paperback. . . . . Books ship from the US and Ireland. N° de réf. du libraire V9780521294652

Acheter neuf
EUR 50,63
Autre devise
Frais de port : Gratuit
De Etats-Unis vers France
Destinations, frais et délais

## 7.Computability: An Introduction to Recursive Function Theory

Edité par Cambridge University Press
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Paperback Quantité : 5
impression à la demande
Vendeur
THE SAINT BOOKSTORE
(Southport, Royaume-Uni)
Evaluation vendeur

Description du livre Cambridge University Press. Paperback. État : new. BRAND NEW PRINT ON DEMAND., Computability: An Introduction to Recursive Function Theory, Nigel J. Cutland, 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 Gildel'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. N° de réf. du libraire B9780521294652

Acheter neuf
EUR 43,89
Autre devise
Frais de port : EUR 7,75
De Royaume-Uni vers France
Destinations, frais et délais

## 8.Computability: An Introduction to Recursive Function Theory

Edité par Cambridge University Press (1980)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Couverture souple Quantité : 1
Vendeur
Ria Christie Collections
(Uxbridge, Royaume-Uni)
Evaluation vendeur

Description du livre Cambridge University Press, 1980. État : New. book. N° de réf. du libraire ria9780521294652_rkm

Acheter neuf
EUR 48,43
Autre devise
Frais de port : EUR 3,22
De Royaume-Uni vers France
Destinations, frais et délais

## 9.Computability: An Introduction To Recursive Function Theory

ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Quantité : 1
Vendeur
BWB
(Valley Stream, NY, Etats-Unis)
Evaluation vendeur

Description du livre État : New. Depending on your location, this item may ship from the US or UK. N° de réf. du libraire 97805212946520000000

Acheter neuf
EUR 51,70
Autre devise
Frais de port : Gratuit
De Etats-Unis vers France
Destinations, frais et délais

## 10.Computability: An Introduction to Recursive Function Theory

Edité par Cambridge University Press (2016)
ISBN 10 : 0521294657 ISBN 13 : 9780521294652
Neuf(s) Paperback Quantité : 1
impression à la demande
Vendeur
Ria Christie Collections
(Uxbridge, Royaume-Uni)
Evaluation vendeur

Description du livre Cambridge University Press, 2016. Paperback. État : New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. N° de réf. du libraire ria9780521294652_lsuk

Acheter neuf
EUR 48,71
Autre devise
Frais de port : EUR 3,22
De Royaume-Uni vers France
Destinations, frais et délais