2 - 6 September 2019, Workshop Continuity, Computability, Constructivity - From Logic to Algorithms (CCC 2019), Ljubljana, Slovenia
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.
Invited Speakers: Hannes Diener (Christchurch, New Zealand) , Fabian Immler (Pittsburgh, USA), Florian Steinberg (Paris, France), Thomas Streicher (Darmstadt, France) and Holger Thies (Fukuoka, Japan). Tutorial Speaker: Helmut Schwichtenberg (Munich, Germany).
Extended abstracts (1-2 pages) of original work are welcome. The workshop specifically invites contributions in the areas of 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, Category-theoretic approaches to computation on infinite data, Weihrauch degrees, and related areas.