Skip to main content

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

  • Book
  • © 2011

Overview

  • Now available with Springer

Part of the book series: C.I.M.E. Summer Schools (CIME, volume 79)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

About this 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.

Bibliographic Information

  • Book Title: Recursion Theory and Computational Complexity

  • Book Subtitle: 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

  • Editors: G. Lolli

  • Series Title: C.I.M.E. Summer Schools

  • DOI: https://doi.org/10.1007/978-3-642-11072-6

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2011

  • Softcover ISBN: 978-3-642-11071-9Published: 30 November 2010

  • eBook ISBN: 978-3-642-11072-6Published: 17 June 2011

  • Edition Number: 1

  • Number of Pages: 236

  • Number of Illustrations: 6 b/w illustrations

  • Topics: Mathematical Logic and Foundations

Publish with us