Pastāsti draugiem par šo preci:
Computability, Enumerability, Unsolvability: Directions in Recursion Theory - London Mathematical Society Lecture Note Series S B Cooper
Computability, Enumerability, Unsolvability: Directions in Recursion Theory - London Mathematical Society Lecture Note Series
S B Cooper
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.
356 pages, Illustrations
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 1996. gada 11. janvāris |
| ISBN13 | 9780521557368 |
| Izdevēji | Cambridge University Press |
| Lapas | 356 |
| Izmēri | 152 × 228 × 21 mm · 507 g |
| Valoda | Angļu |
| Redaktors | Cooper, S. B. (University of Leeds) |
| Redaktors | Slaman, T. A. (University of Chicago) |
| Redaktors | Wainer, S. S. (University of Leeds) |
Vairāk no S B Cooper
Rādīt visuVairāk no tā paša izdevēja
Skatīt visus S B Cooper ( piem., Paperback Book )