"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature.".
| ISBN: | 9781138404106 |
| Publication date: | 10th June 2019 |
| Author: | Andrea Sorbi |
| Publisher: | CRC Press |
| Format: | Hardback |
| Pagination: | 380 pages |
| Series: | Lecture Notes in Pure and Applied Mathematics |
| Genres: |
Mathematical theory of computation Mathematical logic |
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science.
Complexity, Logic, and Recursion Theory features in the following genres: Mathematical theory of computation, Mathematical logic
Hardback, Ebook, Paperback. £189.00, down from the £210.00 cover price. Not Available.
Complexity, Logic, and Recursion Theory was written by Andrea Sorbi and published by CRC Press
Complexity, Logic, and Recursion Theory has 380 pages
Yes it is part of Lecture Notes in Pure and Applied Mathematics series
£189.00, reduced from £210.00. Not Available.