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.
If full versions of papers are already available as technical report or arXiv version, then
corresponding links should be added to the reference list.
Final versions of abstracts might be distributed to participants in hardcopy and/or in
electronic form.
Most travelers coming to Kyoto from abroad arrive at Kansai International Airport (KIX).
You may also arrive at Itami Airport (ITM) through a domestic connecting flight.
From Kansai International Airport the Haruka limited express train can be used to reach Kyoto station.
Trains depart every 30 minutes and the journey takes about 75 minutes.
There are also airport buses going from KIX to JR Kyoto station.
From Tokyo or another city in Japan, the Shinkansen can be used to reach JR Kyoto Station.
Unfortunately, there are very few hotels in the direct vicinity of Kyoto university.
However, there are plenty of options in downtown Kyoto (the Shijo - Sanjo, Kawaramachi - Karasuma area).
From there, you can take Kyoto City Bus No. 7 (bound for Ginkakuji/Kinrin Shako-mae) from either the Shijo Kawaramachi or Kawaramachi Sanjo bus stop , or No. 203 from the Shijo Kawaramachi or Gion bus stop.
Get off at Kitashirakawa bus stop, then walk to RIMS. Due to the high number of tourists in Kyoto, we recommend that you book your accommodation as early as possible.
CCA Steering Committee
Vasco Brattka, chair (Munich, Germany and Cape Town, South Africa),
Peter Hertling (Munich, Germany),
Mathieu Hoyrup (Nancy, France),
Zvonko Iljazović (Zagreb, Croatia),
Akitoshi Kawamura (Kyoto, Japan),
Arno Pauly (Swansea, UK),
Klaus Weihrauch (Hagen, Germany),
Ning Zhong (Cincinnati, USA),
Martin Ziegler (Daejeon, Republic of Korea)
Further Information
For further information, please contact
Holger Thies, chair of the Organizing Committee,
(for matters regarding organization)
Eike Neumann, chair of the Program Committee,
(for submissions)
