Items related to Computability: An Introduction to Recursive Function...

Computability: An Introduction to Recursive Function Theory - Hardcover

  • 4.03 out of 5 stars
    32 ratings by Goodreads
 
9780521223843: Computability: An Introduction to Recursive Function Theory

Synopsis

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.

"synopsis" may belong to another edition of this title.

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

"About this title" may belong to another edition of this title.

Buy Used

Condition: Good
Former library book; may include...
View this item

FREE shipping within U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

9780521294652: Computability: An Introduction to Recursive Function Theory

Featured Edition

ISBN 10:  0521294657 ISBN 13:  9780521294652
Publisher: Cambridge University Press, 1980
Softcover

Search results for Computability: An Introduction to Recursive Function...

Stock Image

Cutland, N. J.
Published by Cambridge University Press, 1980
ISBN 10: 0521223849 ISBN 13: 9780521223843
Used Hardcover

Seller: Better World Books, Mishawaka, IN, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # 4303327-6

Contact seller

Buy Used

US$ 55.42
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket