Stock image for illustration purposes only - book cover, edition or condition may vary.
Recursion Theory and Computational Complexity
G. Lolli
€ 60.83
FREE Delivery in Ireland
Description for Recursion Theory and Computational Complexity
Paperback. Covers such topics as: Admissible recursion theory; Computational complexity and recursion theory; A survey of set recursion; Priority arguments in Higgler recursion; Construction in the recursively enumerable degrees; and, Recursively invariant recursion theory. Series: CIME Summer Schools. Num Pages: 240 pages, 6 black & white illustrations, biography. BIC Classification: PBC. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 12. Weight in Grams: 343.
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.
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.
Product Details
Format
Paperback
Publication date
2010
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
240
Condition
New
Series
CIME Summer Schools
Number of Pages
236
Place of Publication
Berlin, Germany
ISBN
9783642110719
SKU
V9783642110719
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Recursion Theory and Computational Complexity