CCC 2025

Continuity, Computability, Constructivity -
From Logic to Algorithms

1 - 3 September 2025 (Swansea, UK)

CCC (Continuity, Computability, Constructivity) is a workshop series that brings together researchers applying logical methods to the development of algorithms, with a particular focus on computation with infinite data, where issues of continuity, computability and constructivity play major roles. Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related areas. The overall aim is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and provably correct algorithms for computations with real numbers and other continuous data, which are of increasing importance in safety critical applications and scientific computation.

This year the workshop is hosted by Swansea University at the Computational Foundry (Bay Campus).

There will be a special session dedicated to Norbert Müller on the occasion of his retirement.

Steering Committee
Ulrich Berger (Swansea)
Akitoshi Kawamura (Kyoto)
Norbert Müller (Trier)
Svetlana Selivanovа (Novosibirsk)
Dieter Spreen (Siegen)
Holger Thies (Kyoto)
Linda Westrick (PennState)
Martin Ziegler (KAIST)
Programme Committee
Olivier Bournez (Paris)
Peter Collins (Maastricht)
Daniel Graça (Algarve)
Takayuki Kihara (Nagoya)
Olga Petrovska (Swansea)
Anton Setzer (Swansea)
Dieter Spreen (Siegen)
Mukesh Tiwari (Swansea)
Martin Ziegler (KAIST)
Organising Committee
Invited Speakers
Anuj Dawar (Cambridge)
Milly Maietti (Padova)
Cecilia Pradic (Swansea)
Nobuko Yoshida (Oxford)
Further speakers TBA
Previous Workshops
Cologne 2009
Trier 2012
Gregynog 2013
Ljubljana 2014
Kochel 2015
Nancy 2017
Faro 2018
Ljubljana 2019
Faro 2020 (online)
Birmingham 2021 (online)
Padova 2022
Kyoto 2023
Nice 2024

Call for contributed talks

The workshop invites all contributions relating to computation where issues of continuity, computability, and constructivity play major roles. Specific areas of interest include:

  • Exact real number computation
  • Correctness of algorithms on infinite data
  • Computable analysis
  • Complexity of real numbers, real-valued functions, etc.
  • Effective descriptive set theory
  • Domain theory
  • Constructive analysis and topology
  • Constructive foundations
  • Category-theoretic approaches to computation on infinite data
  • Weihrauch degrees
  • Other related areas

Please submit an extended abstract for your talk below (2 pages max., excluding references) by 21 July 1 August 2025 (AoE).

Warning: It is advised to register early with the open review system, specifically if you have a non-university email account.

Please note that for technical reasons the submission point may be temporarily unavailable. This is due to assigning the existing submissions to our reviewers. If the submission point is not available, please wait and try again later.