Recursion Theory and Computational Complexity 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

G. Lolli
    • 29,99 €
    • 29,99 €

Publisher Description

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.

GENRE
Science & Nature
RELEASED
2011
17 June
LANGUAGE
EN
English
LENGTH
236
Pages
PUBLISHER
Springer Berlin Heidelberg
SIZE
7.7
MB