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 |
| Publisher: | Springer Nature |
| Print ISBN: | 9783642110719 |
| eText ISBN: | 9783642110726 |
| Edition: | 1 |
| Copyright: | 2011 |
| Format: | Page Fidelity |
Lifetime - $56.24
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
Details
Table of Contents
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.