Computability (An Introduction to Recursive Function Theory)

Cutland, Nigel

ISBN 10: 0521294657 / ISBN 13: 9780521294652

Published by Cambridge University Press, 1980

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_397040912

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

More

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.

Bibliographic Details

Title: Computability (An Introduction to Recursive ...
Publisher: Cambridge University Press
Publication Date: 1980
Binding: Paperback
Condition: Good