Link to Swansea University Link to Computer Science
Logo for Swansea University and Computer Science

Continuity, Computability, Constructivity
- From Logic to Algorithms (CCC 2013)

Swansea University/Gregynog, 26-30, June 2013


Wednesday, 26 June 2013

16:30Welcome Coffee and Tea
17:30-18:15 Ulrich Berger (Swansea)
Continuity, Computability, Constructivity – From Logic to Algorithms

Thursday, 27 June 2013

9:00-9:45 Pieter Collins (Maastricht)
Computability and Dynamical Systems (Tutorial, part 1)
9:45-10:15Coffee and Tea
10:15-11:05 Margarita Korovina (Novosibirsk), invited speaker
Computing Combinatorial Types of Multi-State Pfaffian Dynamics
11:15-11:45 Mitsuhito Ogawa and To Van Khanh (JAIST, Kanazawa)
A practical alternative to QE-CAD for solving polynomial constraints over real numbers
11:45-12:15 Oleg Kudinov (Novosibirsk)
Some analogue of the class of formally p-adic fields in any characteristic p>0


14:30-15:15 Norbert Müller (Trier)
Fast implementation of exact real number computation (Tutorial, part 1)
15:15-15:45Coffee and Tea
15:45-16:15 Florian Steinberg (Darmstadt)
Computable analytic functions in iRRAM
16:15-16:45 Akitoshi Kawamura (Tokyo)
On small complexity classes for computable analysis
16:55-17:25 Anton Setzer (Swansea)
Coalgebraic Programming Using Copattern Matching
17:25-17:55 Dieter Spreen (Siegen)
The COMPUTAL Project
18:30Dinner (Barbecue)

Friday, 28 June 2013

9:00-9:45 Arno Pauly (Cambridge)
Weihrauch degrees of unsolvability (Tutorial, part 1)
9:45-10:15Coffee and Tea
10:15-11:05 Jean-Michel Muller (Lyon), invited speaker
Proof of Properties in Floating-Point Arithmetic
11:15-11:45 Willem Fouche (University of South Africa)
Fourier spectra of measures associated with algorithmically random Brownian motion
11:45-12:15 Stanislav Speranski (Novosibirsk)
Quantified probability logics: expressibility vs. computability


(continued overleaf)

14:30-15:15 Pieter Collins (Maastricht)
Computability and Dynamical Systems (Tutorial, part 2)
15:15-15:45Coffee and Tea
15:45-16:15 Takayuki Kihara (JAIST, Kanazawa)
A theorem on computable martingales
16:15-16:45 George Davie (University of South Africa)
Some uses of compressibility in probability and computable analysis
16:45-17:45COMPUTAL AGM
18:00-18:20Free openair concert at Gregynog (Oboe)

Saturday, 29 June 2013

9:00 - 9:45 Norbert Müller (Trier)
Fast implementation of exact real number computation (Tutorial, part 2)
9:45-10:15Coffee and Tea
10:15-11:05 Matthias Schröder (Vienna), invited speaker
The extensional hierarchy and the intensional hierarchy over the reals do not coincide
11:15-11:45 Yasuyuki Tsukamoto and Hideki Tsuiki (Kyoto)
A Hausdorff space with a strongly independent dyadic subbase
11:45-12:15 Svetlana Selivanova and Victor Selivanov (Novosibirsk)
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
12:20-12:40 Vladislav Amstislavskiy (Novosibirsk)
On the structures of continuous and smooth functions
12:40-12:55COMPUTAL Planning Meeting

13:00Lunch (Barbecue) followed by free afternoon

15:15-15:45Coffee and Tea
19:30Concert: Academy of St Martin in the Fields

Sunday, 30 June 2013

8:30 - 9:15 Arno Pauly (Cambridge)
Weihrauch Degrees of unsolvability (Tutorial, part 2)
9:15-9:45Coffee and Tea
9:45-10:35 Hajime Ishihara (JAIST, Kanazawa), invited speaker
Classical propositional logic and decidability of variables in intuitionistic propositional logic
10:45-11:15 Peter Hertling (Munich)
Semicontinuity of Clarke's Generalized Gradient


12:30-13:00 Carsten Rösnick (Darmstadt)
Closed Sets and Operators thereon: Representations, Computability and Complexity
13:00-13:30 Andrew Lawrence, Monika Seisenberger and Ulrich Berger (Swansea)
Program Extraction in Action: A Verified Clause Learning SAT Solver
13:30-14:00Coffee and Tea

Gregynog 24 hours telephone: ++44 1686 650224