Publication

2011-09-27 - Springer

Word Count

49,000 words, Guess

Page Count

196 pages

Physical Format

Paperback

Identifiers

  • ISBN-101461208645
  • ISBN-139781461208648
  • Better World Books9781461208648
  • Open LibraryOL28994133M

Description

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: A Mathematical Sketchbook provides a brief but rigorous introduction to the abstract theory of computation, sometimes also referred to as recursion theory. It develops major themes in computability theory, such as Rice's theorem and the recursion theorem, and provides a systematic account of Blum's complexity theory as well as an introduction to the theory of computable real numbers and functions. The book is intended as a university text, but it may also be used for self-study; appropriate exercises and solutions are included.

Subjects

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!