S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D.
Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W.
Maass: Recursively invariant recursion theory.
| ISBN: | 9783642110719 |
| Publication date: | 30th November 2010 |
| Author: | G Lolli |
| Publisher: | Springer-Verlag Berlin and Heidelberg GmbH & Co. K an imprint of Springer-Verlag Berlin and Heidelberg GmbH & Co. KG |
| Format: | Paperback |
| Pagination: | 236 pages |
| Series: | C.I.M.E. Summer Schools |
| Genres: |
Mathematical logic Mathematical foundations |
S. Homer: Admissible recursion theory.- B.E.
Recursion Theory and Computational Complexity features in the following genres: Mathematical logic, Mathematical foundations
Paperback. £28.79, down from the £31.99 cover price. Not Available.
Recursion Theory and Computational Complexity was written by G Lolli and published by Springer-Verlag Berlin and Heidelberg GmbH & Co. K an imprint of Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Recursion Theory and Computational Complexity has 236 pages
Yes it is part of C.I.M.E. Summer Schools series
£28.79, reduced from £31.99. Not Available.