CCC 2020 Programme

(return to the CCC 2020 main webpage)

Important notice: All times are given in Western European Summer Time (UTC +1)

Monday, August 31

9:00 – 10:00	Elvira Mayordomo (invited speaker) *Effective dimension: from computation to fractal geometry and number theory* – Slides
10:00 – 10:30	Coffee break
10:30 – 11:00	Samuele Maschio *Extending the extensional level of the Minimalist Foundation to axiomatic set theories*
11:00 – 11:30	Maria Emilia Maietti, Davide Trotta and Margherita Zorzi *Choice principles via the existential completion*
11:30 – 12:00	Ming Ng *Pointfree Construction of Positive Real Exponentiation*
12:00 – 14:00	Lunch
14:00 – 14:30	Bruno Dinis and Pedro Pinto *Quantitative information on the strong convergence of algorithms via proof mining –* Slides
14:30 – 15:00	Ulrich Berger, Andrew Lawrence and Monika Seisenberger *Towards the extraction of clause learning* – Slides
15:00 – 15:30	Coffee break
15:30 – 16:00	Pieter Collins *Rigorous Function Calculi-III*
16:00 – 16:30	Serdar Erbatur, Ulrich Schöpp and Chuangjie Xu *Type-based Enforcement of Infinitary Trace Properties for Java*

Tuesday, September 1

9:00 – 10:00	Hideki Tsuiki (invited speaker) *Combining partial maps into a correct total map through program extraction* – Slides
10:00 – 10:30	Coffee break
10:30 – 11:00	Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio Omodeo and Gaetano Spartà *Decision algorithm for a fragments of real analysis involving differentiable functions with convexity and concavity predicates on (semi-) open intervals*
11:00 – 11:30	Francesco Ciraulo *On the order-enriched category of overlap-algebras* – Slides – Video
11:30 – 12:00	Partha Pratim Ghosh *Internal Neighbourhood Structures*
12:00 – 14:00	Lunch
14:00 – 15:00	Holger Boche (invited speaker) *Computability in Information Sciences and Technology*
15:00 – 15:30	Coffee break
15:30 – 17:00	CID Management meeting; CID Training Board meeting

Wednesday, September 2

9:00 – 10:00	Hongseok Yang (tutorial speaker) *Probabilistic Programming: Introduction and Semantic Foundation* (part 1) – Slides
10:00 – 10:30	Coffee break
10:30 – 11:00	Tonicha Crook and Arno Pauly *Finding Roots of Polynomials*
11:00 – 11:30	Vittorio Cipriani *A Weihrauch analysis on principles equivalent to Π^1_1-CA_0*
11:30 – 12:00	Sam Sanders *On the logical and computational properties of the uncountable*

Thursday, September 3

9:00 – 10:00	Hongseok Yang (tutorial speaker) *Probabilistic Programming: Introduction and Semantic Foundation* (part 2) – Slides
10:00 – 10:30	Coffee break
10:30 – 11:00	Antonin Callard and Mathieu Hoyrup *Descriptive complexity on non-Polish spaces*
11:00 – 11:30	Manlio Valenti *Computing the Fourier dimension*
11:30 – 12:00	Willem Fouché *Computable profinite groups and randomness* – Slides
12:00 – 14:00	Lunch
14:00 – 14:30	Zoltán Ernő Csajbók *Rough Continuity of Rough Real Functions*
14:30 – 15:00	Riccardo Gozzi and Daniel Graça *Using differential equations to characterize complexity classes*
15:00 – 15:30	Michael Bukatin *Higher-order neuromorphic computations with linear streams* – Slides

Friday, September 4

9:00 – 10:00	Eike Neumann (invited speaker) *Composition of uniform envelopes*
10:00 – 10:30	Coffee break
10:30 – 11:00	Arno Pauly *On the non-existence of some universal spaces*
11:00 – 11:30	Danut Rusu and Gabriel Ciobanu *Interior operators generated by ideals in complete domains*
11:30 – 12:00	Anton Freund, Michael Rathjen and Andreas Weiermann *Kruskal’s tree theorem and continuous transformations of partial orders*

This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 731143.