You are here

Recursion Theory and Computational Complexity

G. Lolli, editor
Publisher: 
Springer
Publication Date: 
2010
Number of Pages: 
236
Format: 
Paperback
Series: 
CIME Summer Schools 79
Price: 
49.95
ISBN: 
9783642110719
Category: 
Proceedings
We do not plan to review this book.

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.

Dummy View - NOT TO BE DELETED