Conference Schedule

Friday
2 Nov
18:00-20:00 Registration (All Africa House)
Saturday
3 Nov
8:00 Registration (Conference Venue)
9:20 Opening
9:30 Thomas A. Henzinger (Invited Speaker)
Three Sources of Infinity in Computation: Nontermination, Real Time, and Probabilistic Choice
10:30 Coffee Break
11:00 Michael Ummels
The Complexity of Finding Nash Equilibria in Infinite Multiplayer Games
11:20 Jacques Duparc and Alessandro Facchini
Complexity of Delta^1_2 Sets and mu-Calculus: when Infinite Games make Modal Logic and Descriptive Set Theory Meet
11:40 Douadi Mihoubi
On the Sets of Infinite Words Recognized by Deterministic one Turn Pushdown Automata
12:00 Valentin Goranko and Wilmari Bekker
Infinite-State Verification of the Basic Tense Logic on Rational Kripke Models
12:20 Govert van Drimmelen
Tableaux and Automata for Parikh's Game Logic
12:40 Lunch Break
14:30 Erich Grädel (Invited Speaker)
Banach-Mazur Games on Graphs
15:30 Coffee Break
15:50 Barnaby Dawson
Generalising Ordinal Time Turing Computation
16:10 Mark Hogarth
Non-Turing Computers are the New Non-Euclidean Geometries
16:30 Feng Liu, Zhoujun Li and Ti Zhou
Boundary on Agent Number Needed in Security Protocol Analysis Based on Horn Logic
16:50 End of the Day
Sunday
4 Nov
9:30 Peter Hertling (Invited Speaker)
Topological Complexity and Degrees of Discontinuity
10:30 Coffee Break
11:00 Timothy McNicholl
Computational Issues in the Theory of Bounded Analytic Functions
11:20 Klaus Weihrauch
Computable Elementary Topology
11:40 Vasco Brattka and Mashudu Makananise
Limit Computable Functions and Subsets on Metric Spaces
12:00 Eyvind Martol Briseid
Effective Rates of Convergence for Picard Iteration Sequences
12:20 Philipp Gerhardy
Proof mining in Ergodic Theory and Topological Dynamics
12:40 Lunch Break
14:30 Willem L. Fouché (Invited Speaker)
Ramsey Theory and the Symmetries of Countably Categorical Structure
15:30 Coffee Break
15:50 Joseph S. Miller (Invited Speaker)
Extracting Information is Hard
16:50 Excursion
19:00 Conference Dinner
21:00 End of the Day
Monday
5 Nov
9:30 Helmut Prodinger (Invited Speaker)
Infinity in Combinatorics: Asymptotic Enumeration
10:30 Coffee Break
11:00 Margaret Archibald and Arnold Knopfmacher
The Average Position of the First Maximum in a Sample of Geometric Random Variables
11:20 George Davie
Complexity Withholding Strings
11:40 Petrus H. Potgieter and Elemér E. Rosinger
Three Perspectives on Right-Sizing the Infinite
12:00 Willem L. Fouché
Fractal Geometry of an Algorithmically Random Brownian Motion
12:20 Lunch Break
14:30 Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi and Hideki Tsuiki
Fractals Defined by Infinite Contractions and Mutual-Recursive Sets
14:50 Hideki Tsuiki and Shuji Yamada
On Finite-time Computable Functions
15:10 Boris Melnikov and Elena Melnikova
Some More on the Billiard Languages and Corresponding Forbidden Languages
15:30 Alain Finkel, Étienne Lozes and Arnaud Sangnier
Towards Model-Checking Pointer Systems
15:50 Adrian R. D. Mathias
Easy Games with Hard Strategies
16:10 Coffee Break
16:30 Joel David Hamkins (Invited Speaker)
New Developments in Infinite Time Turing Machines
17:30 Closing

This schedule might be subject to changes!

Summer School Schedule

Tuesday
6 Nov
9:30 Valentin Goranko
Finitely Presentable Infinite Structures 1
10:30 Coffee Break
11:00 Joel David Hamkins
Infinite Time Computation 1
12:00 Joel David Hamkins
Infinite Time Computation 2
13:00 Lunch Break
14:30 Joel David Hamkins
Infinite Time Computation 3
15:30 Coffee Break
16:00 Benedikt Löwe
Determinacy Axioms and their Logical Strength 1
17:00 Benedikt Löwe
Determinacy Axioms and their Logical Strength 2
18:00 End of the Day
Wednesday
7 Nov
9:30 Benedikt Löwe
Determinacy Axioms and their Logical Strength 3
10:30 Coffee Break
11:00 Erich Grädel
Strategies and Algorithms for Infinite Games 1
12:00 Erich Grädel
Strategies and Algorithms for Infinite Games 2
13:00 Lunch Break
14:30 Erich Grädel
Strategies and Algorithms for Infinite Games 3
15:30 Coffee Break
16:00 Valentin Goranko
Finitely Presentable Infinite Structures 2
17:00 Valentin Goranko
Finitely Presentable Infinite Structures 3
18:00 End of the Day
Thursday
8 Nov
9:30 Willem L. Fouché
The Logic of the Smooth Topos 1
10:30 Coffee Break
11:00 Willem L. Fouché
The Logic of the Smooth Topos 2
12:00 Joseph S. Miller
Effective Randomness 1
13:00 Lunch Break
14:30 Joseph S. Miller
Effective Randomness 2
15:30 Coffee Break
16:00 Valentin Goranko
Finitely Presentable Infinite Structures 4
17:00 Vasco Brattka
Computability on the Reals 1
18:00 End of the Day
Friday
9 Nov
9:30 Willem L. Fouché
The Logic of the Smooth Topos 3
10:30 Coffee Break
11:00 Willem L. Fouché
The Logic of the Smooth Topos 4
12:00 Joseph S. Miller
Effective Randomness 3
13:00 Lunch Break
14:30 Joseph S. Miller
Effective Randomness 4
15:30 Coffee Break
16:00 Vasco Brattka
Computability on the Reals 2
17:00 Vasco Brattka
Computability on the Reals 3
18:00 End of the Day

This schedule might be subject to changes!

Invited Speakers

Programme Committee

Organisers

  • Margaret Archibald, Cape Town, South Africa
  • Vasco Brattka, Cape Town, South Africa
  • Valentin Goranko, Johannesburg, South Africa
  • Hans-Peter Künzi, Cape Town, South Africa
  • Benedikt Löwe, Amsterdam, The Netherlands
Conference Venue

  • Room: Lecture Theater 2 (LT2)
  • Building: Hoerikwaggo (Chemical Engineering)
  • Campus: Upper Campus (University of Cape Town)
  • Map: B/C 7/8
Contact

Laboratory of Foundational Aspects of Computer Science
Department of Mathematics & Applied Mathematics
University of Cape Town
Rondebosch 7701, South Africa