Ninth International Conference on Computability and Complexity in Analysis

June 24-27, 2012, Cambridge, UK

Clare College Bridge, Photos courtesy of Howard J. Green

The ninth conference on Computability and Complexity in Analysis (CCA 2012) takes place immediately after the Alan Turing Centenary 2012

Programme and local arrangements

Please see this page for the schedule and details on the local arrangements.


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 2012 shows some participants in front of the Computer Laboratory:

CCA 2012 Group Picture


The conference poster is available here:


Authors of contributed papers are invited to submit a PDF version of an extended abstract (typically 10-12 pages) on the following web page:


Submission deadline: April 1, 2012
Notification of authors: May 6, 2012
Registration deadline: May 15, 2012
Final version: May 27, 2012


There will be a special issue dedicated to CCA 2012 in the journal

which is an ISI listed open access journal. We invite submissions of original research papers in all CCA related areas to this special issue. Papers not presented at CCA 2012 may also be considered for submission. All papers will be refereed according to the usual standards of a high-quality journal. Submitted papers must not be previously published nor submitted for publication elsewhere.

The submission of authors should follow the instructions that the authors find on the LMCS web page

with the following special author instructions: Authors should prepare their manuscripts using the style file requested by the journal upon submission. Please see the LMCS web page

It is planned that the publication of this special issue follows the following schedule:

Deadline for submission: 11 February 2013
Notification: 8 May 2013

The guest editors of the special issue are Martín Escardó, Arno Pauly, Matthias Schröder and Klaus Weihrauch.

CCA Steering Committee

Vasco Brattka, chair (Cape Town, South Africa), 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