Turing Computability Theory and Applications
This book emphasizes three very important concepts: computability, as opposed to recursion or induction; classical computability; and the art of computability, a skill to be practiced but also important in an esthetic sense of beauty and taste in mathematics.
Saved in:
| Main Author | |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Nature
2016
Springer Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Edition | 1 |
| Series | Theory and Applications of Computability |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783642319334 3642319335 9783642319327 9783662568583 3642319327 3662568586 |
| ISSN | 2190-619X 2190-6203 |
| DOI | 10.1007/978-3-642-31933-4 |
Cover
| Summary: | This book emphasizes three very important concepts: computability, as opposed to recursion or induction; classical computability; and the art of computability, a skill to be practiced but also important in an esthetic sense of beauty and taste in mathematics. |
|---|---|
| Bibliography: | Includes bibliographical references |
| ISBN: | 9783642319334 3642319335 9783642319327 9783662568583 3642319327 3662568586 |
| ISSN: | 2190-619X 2190-6203 |
| DOI: | 10.1007/978-3-642-31933-4 |