Computability: A Mathematical Sketchbook
Douglas S. Bridges
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.
年:
1994
版本:
1
出版商:
Springer
語言:
english
頁數:
189
ISBN 10:
0387941746
ISBN 13:
9780387941745
系列:
Graduate Texts in Mathematics volume 146
文件:
PDF, 2.72 MB
IPFS:
,
english, 1994
因版權方投訴,本書無法下載