Handbook of computability and complexity in analysis /
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...
Corporate Author: | |
---|---|
Other Authors: | , , , |
Format: | Book |
Language: | English |
Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2021
Cham, Switzerland : Springer, [2021] |
Edition: | 1st ed. 2021 |
Series: | Computer Science (SpringerNature-11645)
Theory and Applications of Computability, In cooperation with the association Computability in Europe, Theory and applications of computability |
Subjects: |
Table of Contents:
- 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