Recursion Theory and Computational Complexity
Author:   G Lolli
Publisher:   Springer
ISBN:  

9783642110757


Pages:   242
Publication Date:   30 March 2011
Format:   Undefined
Availability:   Available To Order   Availability explained
Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock.

Our Price $65.87 Quantity:  
Add to Cart

Share |

Recursion Theory and Computational Complexity


Add your own review!

Overview

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.

Full Product Details

Author:   G Lolli
Publisher:   Springer
Imprint:   Springer
Dimensions:   Width: 23.40cm , Height: 1.30cm , Length: 15.60cm
Weight:   0.345kg
ISBN:  

9783642110757


ISBN 10:   3642110754
Pages:   242
Publication Date:   30 March 2011
Audience:   General/trade ,  General
Format:   Undefined
Publisher's Status:   Unknown
Availability:   Available To Order   Availability explained
Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock.

Table of Contents

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now