12-15 July 2015, Twelfth International Conference on Computability and Complexity in Analysis (CCA 2015), Tokyo, Japan

The conference is concerned with the theory of computability and complexity over real-valued data. 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. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet, present work in progress and exchange ideas and knowledge.

For more information, see the Conference Web Page at http://cca-net.de/cca2015/