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
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 discovered.
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.
Cape Town is very beautiful at this time of the year,
and we expect another successful conference!
Computability and complexity on real numbers
Constructive and reverse analysis
Randomness and computable measure theory
Effective descriptive set theory
Domain theory and interval analysis
Realizability theory and logic
Theory of representations
Computable numbers, subsets and functions
Models of computability on real numbers
Algorithms and implementation of exact real number arithmetic
Abbas Edalat (London, UK)
Mathieu Hoyrup (Nancy, France)
Matthias Schröder (Munich, Germany)
Peter Schuster (Leeds, UK)
Stephen G. Simpson (Pennsylvania, USA)
Michael Yampolsky (Toronto, Canada)
Scientific Programme Committee
Mark Braverman (Toronto, Canada)
Stefano Galatolo (Pisa, Italy)
Peter Hertling, chair (Munich, Germany)
Hajime Ishihara (Ishikawa, Japan)
Vladik Kreinovich (El Paso, USA)
Robert Rettinger (Hagen, Germany)
Alex Simpson (Edinburgh, UK)
Frank Stephan (Singapore)
Margaret Archibald (Cape Town, South Africa)
Vasco Brattka, chair (Cape Town, South Africa)
Holger Spakowski (Cape Town, South Africa)
Authors are invited to submit a PDF abstract (typically 1-2 pages) via the following web page:
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 2011 may also be considered for submission. All papers
will be refereed according to the usual scientific standards.
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
Register as an author on the web page http://www.lmcs-online.org/
and enter the special issue code: 2C0C1A1
(In case you are already registered, go to "profile" and enter the
above special code under "register for special issue".)
Go through the submission routine on the web page.
In Step 0 choose the name of the meeting for which this special issue is
Authors should prepare their manuscripts using the style file
requested by the journal upon submission. Please see the LMCS
It is intended to have a pre-conference sightseeing programme on January 30 and a post-conference sightseeing programme
on February 5, provided sufficiently many participants sign up for this. Further information on the page above.
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).