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 by algorithmic means?

Nowadays this theory has many different facets that embrace topics from computabil...