Computability: A Mathematical Sketchbook (1994) (Graduate Texts in Mathematics #146)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1994
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781461208631
- Related ISBNs:
- 9780387941745
- Publisher:
- Springer New York
- Date of Addition:
- 02/23/21
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.