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 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.
CCA 2010 Poster
Accepted papers will be published as CCA 2010 proceedings in Electronic Proceedings in Theoretical Computer Science (EPTCS).
There will be a special issue dedicated to CCA 2010 in the open access journal
Logical Methods in Computer Science.
All submitted papers will be subject to the usual refereeing process
of the journal. Submitted papers must not be previously published
nor submitted for publication elsewhere and must deviate significantly
from the CCA 2010 conference proceedings in EPTCS. Papers not
presented at CCA 2010 may also be submitted.
The authors should follow the instructions for the authors on the LMCS web page http://www.lmcs-online.org/ojs/information.php with the following special author instructions:
Deadline for submission: November 29, 2010
Notification: March1, 2011
Final Version: April 1, 2011
The guest editors are Martín Escardó, Klaus Weihrauch, Xizhong Zheng and Ning Zhong.