Pdf overview of the schedule: [CCR 2025 SCHEDULE]

Schedule with abstracts: [CCR 2025 SCHEDULE WITH ABSTRACTS]

Monday, June 16

8:45-9:30: Coffee and registration

9:30-10:00: Welcome address

10:00-11:00: Joseph S. Miller, Randomness and the enumeration degrees

11:00-11:45: Takayuki Kihara, Computability-Theoretic Perspectives on the Katetov order

11:45-13:45: Lunch & coffee 

13:45-14:45: Emmanuel Rauzy, Effective bases and notions of effective second countability in computable analysis

14:45-15:30: Ivan Titov, Martin-Löf randomness and differentiation

15:30-16:00: Coffee

16:00-16:45: Thibaut Kouptchinsky, The reverse mathematics of analytic measurability

Tuesday, June 17

8:45-9:15: Coffee

9:15-10:15: Kenshi Miyabe, Solovay reducibility for computably approximable reals

10:15-11:00: Akhil S., Resource-Bounded Kučera-Gács Theorems

11:00-11:45: Quentin Le Houérou, Ramsey-like theorems for the Schreier barrier

11:45-13:45: Lunch & coffee

13:45-14:45: Satyadev Nandakumar, The non-robustness of polynomial-time dimension and the existence of one-way functions

14:45-15:30: Mariya Soskova, Posner-Robinson theorem in the enumeration degrees

15:30-16:00: Coffee

16:00-16:45: Alexis Terrassin, Complexité descriptive de certaines propriétés topologiques d'espaces compacts métrisables

Wednesday, June 18

8:45-9:15: Coffee

9:15-10:15: Rahul Santhanam, Meta-Complexity: introduction and a brief survey

10:15-11:00: Marius Zimand, On one-way functions and the average time complexity of almost-optimal compression

11:00-11:30: Coffee

11:30-12:15: Ellen Hammatt, An introduction to structures computable without delay

12:15-16:15: Lunch & Free time

16:15-18:00: Social program

18:00-...: Conference dinner

Thursday, June 19

8:45-9:15: Coffee

9:15-10:15: Andrea Sorbi, Enumeration reducibility and singleton reducibility: three old projects of Barry Cooper

10:15-11:00: Subin Pulari, The Normality-Dimension thesis: Recent progress and future directions

11:00-11:45: Diego Rojas, Algorithmic randomness in harmonic analysis

11:45-13:45: Lunch & coffee

13:45-14:30: Kakeru Yokoyama, Randomness and agnostic online learning

14:30-15:15: Miguel Aguilar Enriquez, Reverse mathematics of the mountain pass theorem

15:15-15:45: Coffee

15:45-16:30: Kohtaro Tadaki, A refinement of the theory of quantum error-correction by algorithmic randomness

Friday, June 20

8:45-9:15: Coffee

9:15-10:15: Elvira Mayordomo, Using Information Theory in geometric measure theory and profinite groups

10:15-11:00: Rui Li, Bounded arithmetic and differential equations

11:00-11:30: Coffee

11:30-12:15: Jack Yoon, Type zero choice principle and Halin's infinite ray theorem