Tenth International Conference on Computability and Complexity in Analysis

July 8-10, 2013, Nancy, France

Place Stanislas
Place Stanislas, Nancy (Photo from Wikipedia)


The conference is concerned with the theory of computability and complexity over real-valued data.

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. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded.

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.

The topics of interest include foundational work on various models and approaches for describing computability and complexity over the real numbers. They also include complexity-theoretic investigations, both foundational and with respect to concrete problems, and new implementations of exact real arithmetic, as well as further developments of already existing software packages. We hope to gain new insights into computability-theoretic aspects of various computational questions from physics and from other fields involving computations over the real numbers.


Invited Speakers

Scientific Programme Committee

Organizing Committee

Conference Picture

This group picture of CCA 2013 shows some participants:

CCA 2013 Group Picture


The provisional programme of the conference is available here: The conference dinner will take place in the brasserie


Some conference slides are available here:


The conference poster is available here:

Venue & Traveling

The conference takes place at the


The conference venue is not in the city center. There is only one hotel and a youth hostel close to the venue (10 minutes walk), the others are downtown. The venue can be reached by taking the tram or the bus line 128. Here are a few hotel suggestions:

View larger map


Registration for the conference is available here: Early registration deadline: June 7, 2013


The submission of regular papers is closed now. At this stage authors are invited to submit a PDF abstract (typically 1-2 pages) as "informal presentation" via the following web page:

No full papers will be required and informal presentations can be based on ongoing research.


Submission deadline: April 1, 2013
Notification of authors: May 6, 2013
Submission deadline for informal presentations: May 20, 2013
Final version: May 27, 2013

CCA Steering Committee

Vasco Brattka, chair (Munich, Germany), Peter Hertling (Munich, Germany), Ker-I Ko (Stony Brook, USA), Klaus Weihrauch (Hagen, Germany), Ning Zhong (Cincinnati, USA)

Further Information

For further information, please contact