Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorBridges, Douglas S. author
TitleComputability [electronic resource] : A Mathematical Sketchbook / by Douglas S. Bridges
ImprintNew York, NY : Springer New York : Imprint: Springer, 1994
Connect tohttp://dx.doi.org/10.1007/978-1-4612-0863-1
Descript XI, 180 p. online resource

SUMMARY

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


CONTENT

Preliminaries -- 1 What Is a Turing Machine? -- 2 Computable Partial Functions -- 3 Effective Enumerations -- 4 Computable Numbers and Functions -- 5 Riceโ{128}{153}s Theorem and the Recursion Theorem -- 6 Abstract Complexity Theory -- Solutions to Exercises -- Solutions for Chapter 1 -- Solutions for Chapter 2 -- Solutions for Chapter 3 -- Solutions for Chapter 4 -- Solutions for Chapter 5 -- Solutions for Chapter 6 -- References


Mathematics Mathematics Mathematics general



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram