ENGLISH

Computability: A Mathematical Sketchbook

By Douglas S. Bridges (auth.)

Book information

Publisher
Springer-Verlag New York
Year
1994
ISBN
0387941746, 9780387941745
DOI
10.1007/978-1-4612-0863-1
LCC
QA9.59 .B75 1994
Open Library ID
OL1412395M
Language
english
Format
PDF
Filesize
9 MB (9896285 bytes)
Series
Graduate Texts in Mathematics 146
Edition
1
Pages
180\192
Time added
2011-06-04 13:46:07
generalMathematics

Description

Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, Computability: AMathematical 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.

Similar books