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.
CCA 2026 is held as a satellite event of
CiE 2026,
Computability in Europe, July 27-31, 2026, Trier, Germany.
Topics
Computable analysis
Complexity on real numbers
Computable numbers, subsets and functions
Theory of representations
Computable differential equations
Randomness and computable measure theory
Algorithmic fractal dimension
Effective descriptive set theory
Weihrauch complexity
Reverse analysis
Constructive analysis
Domain theory and analysis
Realizability theory and analysis
Models of computability on real numbers
Real number algorithms
Exact real number arithmetic
Tutorial Speaker (jointly with CiE 2026 and MCU 2026)
Olivier Bournez (Paris, France)
Invited Speakers
Manon Blanc (Copenhagen, Denmark)
Matthew de Brecht (Kyoto, Japan)
Emma Dinowitz (New York, USA)
Satyadev Nandakumar (Kanpur, India)
Sewon Park (Ljubljana, Slovenia)
Cécilia Pradic (Swansea, UK)
Contributed Talks
Adejoh, Rosemary & Jakoby, Andreas & Mohanty, Sneha & Schindelhauer, Christian Complexity Bounds for Illumination in 2D using Reflections
Aguilar, Miguel & Aguilera, Juan & Fernandez-Duque, David The Reverse Mathematics of the Mountain Pass Theorem
Brattka, Vasco & Chirache, Guillaume Uniform Computability of PAC Learning
Brattka, Vasco & Sorg, Christopher Computability of the Hahn-Banach Theorem Revisited
Burnik, Konrad On Computability of Universal Block-Diagonalization via Finite Group Representations
Burnik, Konrad & Iljazović Zvonko Computable Homeomorphisms from One-Point Metric Bases
Čelar, Matea & Iljazović, Zvonko & Jelić, Matea & Tarandek, David Effective decompositions of continua with embedded arcs
Hertling, Peter On the Complexity of the Saddle Transition Problem for Hyperbolic Toral Automorphisms
The university has no special deals with any hotels, but as hotel prices tend not to be low in Trier, it is advisable to make reservations as early as possible.
The closest international airport is LUX in Luxembourg, about 40km from the center of Trier.
Public transport within Luxembourg is free, see mobiliteit.lu, however you have to buy a ticket for the part from the border to Trier. Tickets are not available on trains, so please use a vending machine at the station.
Registration
You can register for CCA 2026 on the following web page:
We distinguish between full registration and student registration.
Full registration: Until June 30th: 200 €, from July 1st: 300 €.
Student registration: Until June 30th: 150 €, from July 1st: 200 €.
Fees cover, among other things, local public transport, meals and coffee breaks at the university, access to rooms.
The conference is planned primarily as an in-person event.
However, for those unable to attend on site, an option for remote participation will be provided on a best-effort basis.
If you plan to attend only remotely, please do NOT register but just send an email to Norbert Müller
Funding and Sponsoring
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.
Dates
Submission deadline: May 1, 2026
Notification of authors: June 5, 2026
Final version: June 26, 2026
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 Program Committee,
(for submissions)
Norbert Müller, chair of the Organising Committee,
(for matters regarding organization)
Participants at CCA 1996 in Trier, almost 30 years ago.