Computability, an Introduction to Recursive Function Theory
Cambridge University Press (1980)
| Abstract | 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. | |||||||||
| Keywords | Computable functions Recursion theory | |||||||||
| Categories | ||||||||||
| Buy the book | $41.77 new (26% off) $47.79 direct from Amazon (15% off) Amazon page | |||||||||
| Call number | QA9.59.C87 | |||||||||
| ISBN(s) | 0521223849 0521294657 9780521294652 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesStewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
Arto Salomaa (1985). Computation and Automata. Cambridge University Press.
George Boolos (2007). Computability and Logic. Cambridge University Press.
Piergiorgio Odifreddi (1989). Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads33 ( #37,203 of 556,803 )Recent downloads (6 months)2 ( #39,010 of 556,803 )How can I increase my downloads? |
My notes
Discussion
