Computable Analysis

Exploring the intersection of analysis and recursion theory, this book delves into the computability of functions and sets, addressing questions about the exponential function, closed subsets, differentiation, integration, complex polynomials, and the Mandelbrot set. It serves as a comprehensive introduction for graduate and senior students in computer science and mathematics, featuring numerous examples and exercises that encourage active engagement with the material. The text aims to establish a solid foundation in computable analysis and computational complexity.