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.
The conference CCA 2019 is followed by the conference
Computability in Europe (CiE 2019)
that takes place in Durham, UK, from July 15-19, 2019.
Topics
Computable analysis
Complexity on real numbers
Constructive analysis
Domain theory and analysis
Effective descriptive set theory
Theory of representations
Computable numbers, subsets and functions
Randomness and computable measure theory
Models of computability on real numbers
Realizability theory and analysis
Reverse analysis
Weihrauch complexity
Real number algorithms
Implementation of exact real number arithmetic
Invited Speakers
Hannes Diener (Christchurch, New Zealand)
Jacques Duparc (Lausanne, Switzerland)
Hugo Férée (Kent, UK)
Guido Gherardi (Bologna, Italy)
Bruce Kapron (Victoria, Canada)
Joël Ouaknine (Saarbrücken, Germany)
Svetlana Selivanova (Daejeon, Republic of Korea and Novosibirsk, Russia)
Scientific Programme Committee
Verónica Becher (Buenos Aires, Argentina)
Vasco Brattka, chair (Munich, Germany)
Akitoshi Kawamura, co-chair (Fukuoka, Japan)
Neil Lutz (Pennsylvania, USA)
Alberto Marcone (Udine, Italy)
André Nies (Auckland, New Zealand)
Peter Schuster (Verona, Italy)
Dieter Spreen (Siegen, Germany)
Florian Steinberg (Saclay, France)
Sebastiaan Terwijn (Nijmegen, The Netherlands)
Organising Committee
Konrad Burnik (Amsterdam, The Netherlands)
Marko Horvat (Zagreb, Croatia)
Zvonko Iljazović, chair (Zagreb, Croatia)
Matea Kalinić (Split, Croatia)
Bojan Pažek (Zagreb, Croatia)
Programme
The provisional programme and the abstract booklet of the conference are available here:
Funding opportunities for student members of the Association for Symbolic Logic
(ASL) are available. Applications should be directed to the Association for Symbolic Logic three months prior to the meeting,
following these instructions.
Submissions
Authors are invited to submit 1-2 pages abstracts in PDF format,
including references via the following web page:
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.
The conference participants are kindly requested to book their own accommodation. Some hotels relatively close to the conference venue are (the
distances are the approximate distances from the conference venue):
Zagreb is connected by daily flights to many European destinations.
More information about arrivals by plane, as well as about train and road connections to other European countries and elsewhere can be found at
the following web site.
Public transportation to and from the venue
The bus routes connecting the bus station at Kaptol (near the main cathedral and the main square) and the Department of Mathematics are:
106, 201, 226, 238. Exit the bus at the first stop after the roundabout at Bijenicka.
If you inadvertently miss the bus stop Bijenicka, you can also exit the bus at the next stop (bus stop Institute Rudjer Boskovic) - they are only a few minutes walk apart.
The bus routes connecting Kvaternikov trg and the bus stop Bijenicka are: 201 and 204.
Bus/tram tickets can be used for any number and combination of buses and trams - their validity is limited by time
(the duration depends on the cost of the ticket) and direction (one ticket can only be used in one direction).
Tickets can be bought in buses or trams from the driver or at most newspaper stands (the cheapest 4 kn ticket, which is valid for half an hour, is only available at the stands).
Walking directions: 27 minutes from the main square or 10 minutes from the tram stop Gupceva zvijezda (approximations taken from Google maps) -
the tram stop is served by tram lines 8 and 14 ending at Mihaljevac. Note that the venue is on a relatively steep hill, so the walking routes mentioned are fairly demanding.
CCA Steering Committee
Vasco Brattka, chair (Munich, Germany and Cape Town, South Africa),
Peter Hertling (Munich, Germany),
Akitoshi Kawamura (Fukuoka, Japan),
Klaus Weihrauch (Hagen, Germany),
Ning Zhong (Cincinnati, USA),
Martin Ziegler (Daejeon, Republic of Korea)
Further Information
For further information, please contact
Vasco Brattka, chair of the Programme Committee,
(for submissions)
Zvonko Iljazović, chair of the Organizing Committee,
(for local information)