Delivery included to the United States

Recursion Theory and Computational Complexity

Recursion Theory and Computational Complexity Lectures Given at the Centro Internazionale Matematico Estivo (C.I.M.E.) Held in Bressanone (Bolzano), Italy, June 14-23, 1979 - CIME Summer Schools

Reprint of the 1st ed. C.I.M.E., Ed. Liguori, Napoli & Birkhäuser, 1981

Paperback (30 Nov 2010)

Save $3.74

  • RRP $43.74
  • $40.00
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 7 days

Publisher's 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.

Book information

ISBN: 9783642110719
Publisher: Springer Berlin Heidelberg
Imprint: Springer
Pub date:
Edition: Reprint of the 1st ed. C.I.M.E., Ed. Liguori, Napoli & Birkhäuser, 1981
DEWEY: 511.35
DEWEY edition: 22
Language: English
Number of pages: 240
Weight: 343g
Height: 234mm
Width: 156mm
Spine width: 12mm