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

by G. Lolli

236 pages· 2011· ISBN 9783642110726
Join Readfeed freeFind clubs reading this bookBrowse readable books
About
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.

Discuss Recursion Theory and Computational Complexity with other readers

Join or start a book club for Recursion Theory and Computational Complexity on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Recursion Theory and Computational Complexity?

Sign up free on Readfeed, then browse public clubs or start your own club with Recursion Theory and Computational Complexity as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Recursion Theory and Computational Complexity with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Recursion Theory and Computational Complexity with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.