Tallenna
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.
- Alaotsikko
- 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
- Toimittaja
- G. Lolli
- Painos
- Reprint of the 1st ed. C.I.M.E., Ed. Liguori, Napoli & Birkhäuser, 1981
- ISBN
- 9783642110719
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 30.11.2010
- Sivumäärä
- 236
