CCA 2021 Schedule (Time zone: Europe/Berlin)

09:30-09:45

Social Meeting on Wonder

09:45-10:00

Opening

10:00-11:00

Masahiko Yoshinaga - Holonomic constants and the equality decision problem (invited talk)

11:00-11:30

Coffee Break on Wonder

11:30-12:00

Riccardo Gozzi and Daniel Graça - Analog characterization of complexity classes (contributed talk)

12:00-12:30

Pedro Pinto and Ulrich Kohlenbach - Quantitative translations for viscosity approximation methods (contributed talk)

12:30-14:00

Lunch Break

14:00-15:00

Iosif Petrakis - Predicative Bishop-Cheng Measure Theory (invited talk)

15:00-15:30

Coffee Break on Wonder

15:30-16:00

Vittorio Cipriani - Cantor-Bendixson theorem in the Weihrauch lattice (contributed talk)

16:00-16:30

Caleb Camrud and Timothy McNicholl - An Effective Completeness Theorem for Computable Presentations and Continuous Logic (contributed talk)

16:30-17:00

Nathanael Ackerman, Julian Asilis, Jieqi Di, Cameron Freer and Jean-Baptiste Tristan - On the Computable Learning of Continuous Features (contributed talk)

09:30-10:30

Marta Fiori Carones - An Algorithm For Reorienting Infinite Pseudo-Transitive Graphs (invited talk)

10:30-11:00

Coffee Break on Wonder

11:00-11:30

Sam Sanders - On the computability theory and Reverse Mathematics of the uncountable (contributed talk)

11:30-12:00

Michal Konečný, Sewon Park and Holger Thies - From Coq proofs to certified exact real computation in AERN (contributed talk)

12:30-14:00

Lunch Break

14:00-15:00

Lars Kristiansen - On Representations of Irrational Numbers: A Degree Structure (invited talk)

15:00-15:30

Coffee Break on Wonder

15:30-16:00

Djamel Eddine Amir and Mathieu Hoyrup - Sets with strong computable type (contributed talk)

16:00-16:30

Matea Čelar and Zvonko Iljazović - Computable type of an unglued space (contributed talk)

16:30-17:00

Diego Rojas and Timothy McNicholl - Computability of weak convergence of measures on the real line (contributed talk)

17:00-17:30

Émile Larroque and Mathieu Hoyrup - When is the Scott topology countably based? (contributed talk)

09:30-10:30

Holger Thies - Uniform Complexity of Solving Partial Differential Equations and Exact Real Computation (invited talk)

10:30-11:00

Coffee Break on Wonder

11:00-11:30

Jiman Hwang, Jihoon Hyun and Hyunwoo Lee - Coloring Subsets of Euclidean Space (contributed talk)

11:30-12:00

Wolfgang Merkle and Ivan Titov - Speedability and Randomness (contributed talk)

12:00-12:30

Matthias Schröder - Computable multifunctions on effectively Hausdorff spaces (contributed talk)

12:30-14:00

Lunch Break

14:00-15:00

Margarita Korovina - Automated Reasoning and Non-Linear Functions (invited talk)

15:00-15:30

Coffee Break on Wonder

15:30-16:30

Ugo Dal Lago - On Higher-Order Cryptography (invited talk)

16:30-16:45

Closing

16:45-17:00

Social Meeting on Wonder