24-27 June 2012, Nineth International Conference on Computability and Complexity in Analysis (CCA 2012), Cambridge, U.K.

Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space.

The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. Despite remarkable progress in recent years many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. The conference provides a unique opportunity for people working in the area of computation on real-valued data but coming from different fields to meet, present work in progress and exchange ideas and knowledge.

Conference Web Page: http://cca-net.de/cca2012/