Computability: An Introduction to Recursive Function Theory Book + PRICE WATCH * Amazon pricing is not included in price watch

Computability: An Introduction to Recursive Function Theory Book

Computability 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. Full descriptionRead More

from£N/A | RRP: £29.99
* Excludes Voucher Code Discount Also available Used from £N/A
  • Blackwell

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

  • Foyles

    This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's...

  • 0521294657
  • 9780521294652
  • Nigel Cutland
  • 19 June 1980
  • Cambridge University Press
  • Paperback (Book)
  • 264
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.