CCA 2025 Schedule (Time zone: Asia/Tokyo)

09:15-09:30

Opening

09:30-10:30

Takako Nemoto: Analysing Turing degree over intuititionistic logic (Invited Talk)

10:30-11:00

Coffee break

11:00-11:30

Kenshi Miyabe: Randomness with respect to c.e. semimeasures

11:30-12:00

Takayuki Kihara: The infinite loop operation and the axiom of dependent choice

12:00-13:30

Lunch

13:30-14:30

Patrick Uftring: Computable transformations of Turing degrees (Invited Talk)

14:30-15:00

Juan Aguilera, Thibaut Kouptchinsky and Keita Yokoyama: The reverse mathematics of analytic measurability

15:00-15:30

Coffee break

15:30-16:00

Luca Ferranti: DedekindCutArithmetic.jl: A Julia implementation of exact real arithmetic based on Dedekind cuts (Online)

16:00-16:30

Hyunwoo Lee and Sewon Park: Relational Reasoning for Verified Reiterative Implementations of Multivalued Real Computations (Online)

09:30-10:30

Yudai Suzuki: TLPP and its surroundings (Invited Talk)

10:30-11:00

Coffee break

11:00-11:30

Ivan Georgiev: Subrecursive degrees of difference representations of irrational numbers

11:30-12:00

Linus Richter: Constructible Failures of Erdős-Volkmann for Rings

12:00-13:30

Lunch

13:30-18:00

Open discussion and informal excursion

18:00-20:00

Conference Dinner

09:30-10:30

Selwyn Ng: Comparing relative information content (Invited Talk)

10:30-11:00

Coffee break

11:00-11:30

Holger Thies: A Verified Power-Series Method for Multivariate IVPs

11:30-12:00

Olivier Bournez and Jacques Dreyfus: Non-deterministic analogue computations with ODEs: Towards a characterisation of NP

12:00-13:30

Lunch

13:30-14:00

Bruce Kapron: Constant-depth Approximation of Nowhere-Differentiable Functions

14:00-14:30

Manon Blanc: PSPACE-completeness of the reachability relation of robust dynamical systems (Online)

14:30-15:00

Coffee break

15:00-15:30

Nan Fang: Speedability of computably approximable reals and their approximations (Online)

15:30-16:00

Vasco Brattka and Emmanuel Rauzy: Computable bases

16:00-16:15

Closing