Libros importados hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Computability: An Introduction to Recursive Function Theory (in English)
Type
Physical Book
Year
1980
Language
English
Pages
262
Format
Paperback
ISBN
0521294657
ISBN13
9780521294652
Edition No.
1

Computability: An Introduction to Recursive Function Theory (in English)

Nigel Cutland (Author) · Cambridge University Press · Paperback

Computability: An Introduction to Recursive Function Theory (in English) - Nigel Cutland

Physical Book

$ 73.36

$ 81.99

You save: $ 8.63

11% discount
  • Condition: New
It will be shipped from our warehouse between Thursday, August 01 and Friday, August 02.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Computability: An Introduction to Recursive Function Theory (in English)"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews