Bookbot

Recursion theory and computational complexity

More about the book

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 purchase

Recursion theory and computational complexity, Gabriele Lolli

Language
Released
2010
product-detail.submit-box.info.binding
(Paperback)
We’ll email you as soon as we track it down.

Payment methods

No one has rated yet.Add rating