CCC2024: Call For Participation

========================================================

CCC 2024: Call For Participation

- program is online - registration is open

========================================================

CALL FOR Participation:

CCC 2024: Continuity, Computability, Constructivity – From Logic to Algorithms

Nice, France, October 2-4 2024 (associated with « Journées calculabilités »)

Conference website: https://www.lix.polytechnique.fr/CCC2024/

========================================================

Topics: constructive mathematics, constructive analysis, computable analysis, exact real number computation

CCC 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.

Previous workshops have been held in 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

========================================================

Invited Speakers:

Confirmed:

• Micaela Mayero (University Sorbonne Paris Nord)
• Svetlana Selivanova (Novosibirsk, Russia)

========================================================

Contributions

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

========================================================

Programme Committee

• Olivier Bournez (IPParis, Ecole Polytechnique, LIX, France)
• Pieter Collins (Maastricht University, The Netherlands)
• Enrico Formenti (Univ. Côte d'Azur, France)
• Daniel Graça (University of Algarve, Portugal)
• Norbert Müller (University of Trier, Germany)
• Sewon Park (Kyoto University, Japan)
• Svetlana Selivanova (Novosibirsk, Russia)
• Dieter Spreen (University of Siegen, Germany)
• Martin Ziegler (KAIST, South Korea)

Organizing Committee

• Olivier Bournez (IPParis, Ecole Polytechnique, LIX, FR)
• Enrico Formenti (Univ. Côte d'Azur, FR)

Steering Committee

• Akitoshi Kawamura (Kyoto University, Japan)
• Norbert Müller (University of Trier, Germany)
• Svetlana Selivanova (Novosibirsk, Russia)
• Dieter Spreen (University of Siegen, Germany)
• Holger Thies (Kyoto University, Japan)
• Linda Westrick (Penn State University, USA)
• Martin Ziegler (KAIST University, South Korea)