​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.

• Part I, Computability in Analysis.- Computability of Real Numbers.- Computability of Subsets of Metric Spaces.- Computability of Differential Equations.- Computable Complex Analysis.- Part II, Complexity, Dynamics, and Randomness.- Computable Geometric Complex Analysis and Complex Dynamics.- A Survey on Analog Models of Computation.- Computable Measure Theory and Algorithmic Randomness.- Algorithmic Fractal Dimensions in Geometric Measure Theory.- Part III Constructivity, Logic, and Descriptive Complexity.- Admissibly Represented Spaces and Qcb-Spaces.- Bishop-Style Constructive Reverse Mathematics.- Weihrauch Complexity in Computable Analysis.- Index

​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.

• Part I, Computability in Analysis.- Computability of Real Numbers.- Computability of Subsets of Metric Spaces.- Computability of Differential Equations.- Computable Complex Analysis.- Part II, Complexity, Dynamics, and Randomness.- Computable Geometric Complex Analysis and Complex Dynamics.- A Survey on Analog Models of Computation.- Computable Measure Theory and Algorithmic Randomness.- Algorithmic Fractal Dimensions in Geometric Measure Theory.- Part III Constructivity, Logic, and Descriptive Complexity.- Admissibly Represented Spaces and Qcb-Spaces.- Bishop-Style Constructive Reverse Mathematics.- Weihrauch Complexity in Computable Analysis.- Index

​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.

• Part I, Computability in Analysis.- Computability of Real Numbers.- Computability of Subsets of Metric Spaces.- Computability of Differential Equations.- Computable Complex Analysis.- Part II, Complexity, Dynamics, and Randomness.- Computable Geometric Complex Analysis and Complex Dynamics.- A Survey on Analog Models of Computation.- Computable Measure Theory and Algorithmic Randomness.- Algorithmic Fractal Dimensions in Geometric Measure Theory.- Part III Constructivity, Logic, and Descriptive Complexity.- Admissibly Represented Spaces and Qcb-Spaces.- Bishop-Style Constructive Reverse Mathematics.- Weihrauch Complexity in Computable Analysis.- Index