Pastāsti draugiem par šo preci:
Complexity, Logic, and Recursion Theory - Lecture Notes in Pure and Applied Mathematics Andrea Sorbi 1. izdevums
Complexity, Logic, and Recursion Theory - Lecture Notes in Pure and Applied Mathematics
Andrea Sorbi
Presents coverage of research at the interface of logic, computability theory, and theoretical computer science. This book integrates two approaches to computability.
380 pages
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 2019. gada 7. jūnijs |
| ISBN13 | 9781138404106 |
| Izdevēji | Taylor & Francis Ltd |
| Lapas | 380 |
| Izmēri | 184 × 263 × 27 mm · 842 g |
| Valoda | Angļu |
| Sērijas redaktors | Nashed, Zuhair (University of Central Florida, Orlando, USA) |
| Sērijas redaktors | Taft, Earl |