Recursion Theory and Computational Complexity

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

Paperback Published on: 30/11/2010
Price: £31.99
Free UK delivery on orders over £25
We can order this from the publisher
Usually dispatched within 3 weeks
Make and edit your lists in your account
No stock available in any shop.
We can order this from the publisher
Usually dispatched within 3 weeks
No stock available in any shop.

Synopsis

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.

Publisher information

  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • ISBN: 9783642110719
  • Number of pages: 236
  • Dimensions: 235 x 155 mm
  • Languages: English

Customer Reviews