Recursion Theory and Computational Complexity
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, 2010
49,95 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9783642110719
- ISBN-10
- 3642110711
- Publisher
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Year
- 2010
- Publication date
- 2010-11-30
- Pages
- 236
- Dimensions
- 233x157x16
- Weight
- 370