You are here

Recursion Theory and Computational Complexity

Publisher: 
Springer
Number of Pages: 
236
Price: 
49.95
ISBN: 
9783642110719
Date Received: 
Wednesday, January 5, 2011
Reviewable: 
Include In BLL Rating: 
Reviewer Email Address: 
G. Lolli, editor
Series: 
CIME Summer Schools 79
Publication Date: 
2010
Format: 
Paperback
Category: 
Proceedings

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.

Publish Book: 
Modify Date: 
Wednesday, January 5, 2011

Dummy View - NOT TO BE DELETED