Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Recursion Theory and Computational Complexity
- Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979
part of the C.I.M.E. Summer Schools series
- Language:
- English
- ISBN:
- 9783642110719
- Binding:
- Paperback
- Pages:
- 236
- Published:
- November 29, 2010
- Edition:
- 1
- Dimensions:
- 155x235x12 mm.
- Weight:
- 760 g.
Delivery:
2-4 weeks
Expected delivery: December 19, 2024
Description of Recursion Theory and Computational Complexity
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.
User ratings of Recursion Theory and Computational Complexity
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Recursion Theory and Computational Complexity can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
