Recomienda este artículo a tus amigos:
Computability: a Mathematical Sketchbook - Graduate Texts in Mathematics Bridges, Douglas S. (University of Canterbury) 1994 edition
Computability: a Mathematical Sketchbook - Graduate Texts in Mathematics
Bridges, Douglas S. (University of Canterbury)
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.
180 pages, biography
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 14 de enero de 1994 |
| ISBN13 | 9780387941745 |
| Editores | Springer-Verlag New York Inc. |
| Páginas | 180 |
| Dimensiones | 156 × 234 × 12 mm · 480 g |
| Lengua | Inglés |