Continuity, Computability, Constructivity – From Logic to Algorithms (original) (raw)

Canaletto, Porta Portello

CCC 2022

From Logic to Algorithms

Dedicated to Dieter Spreen on the Occasion of his 75th Birthday

Department of Mathematics “Tullio Levi-Civita” and Online

Padova, September 19–23, 2022

↓

The CCC Workshop

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. It belongs to the series of annual workshops sponsored by the EU funded consortium on Computing with Infinite Data.

Specific topics include exact real number computation, computable analysis, effective descriptive set theory, constructive analysis and topology, 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.

Participation is welcome in person or online.

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

Programme

• Special session in honor of 75th Birthday of Dieter Spreen on 23rd September.
• Social dinner on Thursday 22 at 20.30
• Buffet on Friday 23 at the end of the session

Click here to download the schedule in pdf

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

Participation is open both in presence and online.

Extended abstracts (1-2 pages) of original work should be submitted in pdf format.

Submission link: https://easychair.org/conferences/?conf=ccc20220

Notification of acceptance: August 26, 2022

All questions about submissions should be emailed to ccc22@math.unipd.it

Contributed Talks

• Ulrich Berger, Sewon Park, Holger Thies and Hideki Tsuiki
  Some steps toward program extraction in a type-theoretical interpretation of IFP (Slides) (Video)
• Pieter Collins
  Rigorous Function Calculi-V (Slides) (Video)
• Willem Fouché, Safari Mukeru and George Davie
  On local times of Martin-Löf random Brownian motion (Slides) (Video)
• Davide Trotta, Manlio Valenti and Valeria de Paiva
  Categorifying Computable Reducibilities(Slides) (Video)
• Nicolai Kraus, Fredrik Nordvall Forsberg and Chuangjie Xu
  Constructivity Aspects of Brouwer Tree Ordinals (Slides) (Video)
• Luis Gambarte
  Categories with a base of computability(Slides)
• Daniel Graça and Ning Zhong
  Robust non-computability (Slides) (Video)
• Keita Hiroshima
  A number that has an elementary trace function and no elementary sum approximation
• Bruce Kapron
  Hereditarily Total Sequential Functionals of Finite Type (Slides) (Video)
• Akitoshi Kawamura
  Polynomial-time equivalent representations of compact sets in Euclidean spaces
• Michal Konecny, Sewon Park and Holger Thies
  Certified exact real computation on hyperspaces (Slides) (Video)
• Pietro Sabelli and Maria Emilia Maietti
  On the relationship between well-founded sets and inductive generation of pointfree topology (Slides) (Video)
• Arno Pauly and Linda Brown Westrick
  Weihrauch reductions between step functions (Slides)
• Iosif Petrakis
  Sets completely separated by functions in Bishop Set Theory(Slides)
• Giuseppe Rosolini
  Grothendieck topologies and weak limits (Slides) (Video)
• Sam Sanders
  On the computational properties of basic mathematical notions(Slides)
• Paul Taylor
  Narrowing the gap between point-free topology and exact real computation (Slides)
• Hideki Tsuiki
  Induction and coinduction for computing exact overlaps of fractals(Slides) (Video)
• Benno van den Berg
  Implicative algebras for modified realizability (Slides) (Video)
• Todd Waugh Ambridge
  A type of constructive real numbers for global optimisation (Slides) (Video)

Registration

To register, please fill up the registration form.

Registration deadline: September 18, 2022

Venue

• Torre Archimede, Department of Mathematics (Google Maps)
• Address: Via Trieste, 63 - 35121 Padova (Italy)
• Tel: +39 049 827 1200
• Fax: +39 049 827 1499
• E-mail: dipmath@math.unipd.it

Suggestions for lunch

All the suggested lunch spots are within a seven-minute walk from the Math Department. See the lunch spots on Google Maps.