The Handbook of Computability and Complexity in Analysis (henceforth, the Handbook) is a compilation of surveys on different topics in the theory and applications of computable analysis. With contributions from 22 authors, it is a much-needed resource for graduate students, early-career researchers, and established scholars in a field often regarded as inaccessible. The volume provides an introduction to the main areas of research in computable analysis within the type II theory of effectivity (TTE) framework introduced by Klaus Weihrauch in the 1980s. Covering topics ranging from the computability of real numbers to advanced applications, it serves as a valuable entry point for those studying the effective content of classical analysis and for researchers applying computability theory to classical problems.
The Handbook contains 11 chapters divided into three parts, together with a preface, a table of contents, a list of contributors, and an index. Part I covers the machinery required for computable real and complex analysis, including the computability of real and complex numbers, the effective topology of metric spaces, and the computability of differential equations. Part II focuses on applications in geometry, measure theory, dynamical systems, and analog computation. Part III explores the structural and logical dimensions of computable analysis, addressing frameworks for representing spaces and analyzing the logical strength of theorems.
Part I, Computability in Analysis, lays the foundation by presenting core theories and models of computation over continuous structures. Rettinger and Zheng open with a survey on the computability of real numbers, clarifying how approximation and representation underpin numerical computation in analysis. Iljazović and Kihara follow with a chapter on computable subsets of metric spaces, covering effective metric space topology, representations of closed sets, and representations of hyperspaces. Graça and Zhong offer a detailed treatment of computability in differential equations, addressing effective existence and uniqueness theorems along with computational complexity aspects. Andreev and McNicholl conclude the part with a discussion of computable complex analysis, including the computability theory of analytic functions, conformal maps, and infinite products. Together, these chapters form a cohesive introduction to the machinery of TTE and a rigorous computational approach to real and complex analysis.
Building on these foundations, Part II, Complexity, Dynamics, and Randomness, examines advanced themes at the intersection of computation, dynamical behavior, and randomness in analytic settings. Rojas and Yampolsky provide a comprehensive overview of computable complex dynamics, emphasizing the computability of Julia sets, conformal structures, and dynamical invariants. Bournez and Pouly survey analog models of computation, framing continuous-time systems based on differential equations as theoretical computation devices and analyzing their complexity-theoretic power. Hoyrup and Rute’s chapter on computable measure theory and algorithmic randomness connects probabilistic structure with computability, elucidating randomness notions relative to computable measures. Lutz and Mayordomo close the part with a study of algorithmic fractal dimension, linking algorithmic information theory and geometric measure theory to quantify complexity in fractal sets. These chapters highlight the depth and variety of computability-theoretic techniques applied to dynamical systems, probabilistic models, and geometrically complex structures.
Shifting from concrete applications to metatheoretical perspectives, Part III, Constructivity, Logic, and Descriptive Complexity, covers the logical and structural aspects of computable analysis. Schröder’s chapter on admissibly represented spaces and QCB spaces presents a topological approach to computation on general spaces, emphasizing the role of representations in defining continuity and computability. Diener and Ishihara provide a detailed account of Bishop-style constructive reverse mathematics, blending constructive analysis with foundational questions about the logical principles underlying key theorems. Brattka, Gherardi, and Pauly conclude the volume with a chapter on Weihrauch complexity, developing a fine-grained hierarchy for classifying the uniform computational content of mathematical theorems. This part complements the earlier sections by showing how computability interacts with logic, constructivism, and the structure of mathematical reasoning, offering a metatheoretical perspective essential for understanding the full landscape of computable analysis.
The Handbook will be most useful to doctoral students seeking dissertation topics, early-career researchers exploring new problems, and anyone looking for an authoritative reference in computable analysis. It is structured as a reference text—results are stated without proofs—making it especially suitable for guiding seminars or special topics courses. Instructors can pair individual chapters with selected research articles that provide proofs of the stated results.
One of the book’s strengths is its accessibility. Early computable analysis texts, such as Klaus Weihrauch’s 2000 Computable Analysis, have been criticized for their cryptic style, but the Handbook is notably more readable. While it does not match the depth of highly specialized texts such as Downey and Hirschfeldt’s 2010 Algorithmic Randomness and Complexity and Pour-El and Richards’ 1989 Computability in Analysis and Physics, it excels in breadth. Analog computation is particularly well covered, and the treatment of computable complex analysis in Chapters 4 and 5 is especially strong. The chapter on computability of subsets of metric spaces stands out as a practical reference, as does the concluding chapter on Weihrauch complexity. Overall, the volume has a coherent structure and a variety of topics that will benefit anyone interested in computable analysis.
In sum, the Handbook is a valuable and well-organized resource, representing most of the major subfields of computable analysis. It offers an excellent starting point for researchers still deciding which area to pursue and is highly recommended for serious students and postdoctoral fellows seeking open problems in the field.
