Ask Bookie
{
"item_title" : "Recursion Theory and Computational Complexity",
"item_author" : [" G. Lolli "],
"item_description" : "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.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/64/211/071/3642110711_b.jpg",
"price_data" : {
"retail_price" : "49.95", "online_price" : "49.95", "our_price" : "49.95", "club_price" : "49.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Recursion Theory and Computational Complexity : Lectures Given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) Held in Bre
by G. Lolli
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.
This item is Non-Returnable
Customers Also Bought
- 1
Details
- ISBN-13: 9783642110719
- ISBN-10: 3642110711
- Publisher: Springer
- Publish Date: November 2010
- Dimensions: 9.21 x 6.14 x 0.51 inches
- Shipping Weight: 0.75 pounds
- Page Count: 236
Related Categories
You May Also Like...
- 1
