Computability : a mathematical sketchbook
Author(s)
Bibliographic Information
Computability : a mathematical sketchbook
(Graduate texts in mathematics, 146)
Springer-Verlag, c1994
- : us
- : gw
Available at / 111 libraries
-
Etchujima library, Tokyo University of Marine Science and Technology自然
: New York410.8||G 3||146179324
-
Hiroshima University Central Library, Interlibrary Loan
: New York410.96:B-73/HL2034002000411934
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
: New Yorkdc20:511.3/b7642070293118
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. [173]-175) and index
Description and Table of Contents
- Volume
-
: us ISBN 9780387941745
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.
Table of Contents
Preliminaries.- 1 What Is a Turing Machine?.- 2 Computable Partial Functions.- 3 Effective Enumerations.- 4 Computable Numbers and Functions.- 5 Rice'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.
- Volume
-
: gw ISBN 9783540941743
Description
Aimed at mathematicians and computer scientists who will only be exposed to one course in this area, this is 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.
by "Nielsen BookData"