Skip to main content

Handbook of Computability and Complexity in Analysis

  • Book
  • © 2021


  • Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science
  • Researchers and graduate students will appreciate the book's systematic introductions into many branches of computable analysis
  • Dedicated to Klaus Weihrauch, the leading pioneer and teacher in this domain
  • Further domain information available at

Part of the book series: Theory and Applications of Computability (THEOAPPLCOM)

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

Access this book

eBook USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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 (11 chapters)

  1. Computability in Analysis

  2. Complexity, Dynamics, and Randomness

  3. Constructivity, Logic, and Descriptive Complexity


About this book

Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing's seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means?

Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology.

This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapters are written by leading experts working at the cutting edge of the respective topic. Researchers and graduate students in the areas of theoretical computer science and mathematical logic will find systematic introductions into many branches of computable analysis, and a wealth of information and references that will help them to navigate the modern research literature in this field.

Editors and Affiliations

  • Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch, South Africa

    Vasco Brattka

  • Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, Germany

    Peter Hertling

About the editors

Vasco Brattka is a professor for Theoretical Computer Science and Mathematical Logic at the Universität der Bundeswehr München and an Honorary Research Associate at the University of Cape Town. He is the Editor-in-Chief of Computability, the journal of the association, Computability in Europe, published by IOS Press. His research interests include computable analysis, computability theory, effective descriptive set theory, algorithmic randomness, complexity and logic, and Weihrauch complexity. 

Peter Hertling is a professor in the Institut für Theoretische Informatik, Mathematik und Operations Research at the Universität der Bundeswehr München. He is an Associate Editor of the Journal of Complexity, published by Elsevier. His research interests include computable analysis, descriptive complexity and algorithmic randomness, complexity theory over the real numbers, and information-based complexity.

Bibliographic Information

Publish with us