16:30-17:00 Vittorio Cipriani (Italy) and Arno Pauly (UK) - Embeddability of graphs and Weihrauch degrees
17:30-18:00 Michal Konecny (UK), Sewon Park (JP) and Holger Thies (JP) - Nondeterministic limits and certified exact real computation
20:30-21:00 Sam Sanders (Ger) and Dag Normann (Nor) - On the computational properties of basic mathematical notions
22:00-23:00 Keynote - Alexander Melnikov (Wellington, New Zealand) - Computable topology and topological groups
14:30-15:30 Keynote - Elvira Mayordomo (Zaragoza, Spain) - Exploring the point-to-set principles for algorithmic dimensions
15:30-16:00 Matthew de Brecht (JP) - A note on the closed prime spectrums of coPolish commutative rings
16:30-17:00 Djamel Eddine Amir and Mathieu Hoyrup (FR) - Descriptive complexity of topological invariants
17:00-17:30 Peter Hertling and Philip Janicki (Ger) - Further Properties of Nearly Computable Real Numbers
17:30-18:30 Keynote - Vassils Gregoriades (Athens, Greece) - Fixed points of positive formulae and of monotone functions
19:30-20:30 Keynote - Isaac Goldbring (Irvine, USA) - Oracle computability of conditional expectations onto subfactors
21:00-21:30 Cameron Fraize, Douglas Cenzer, and Christopher P. Porter (USA) - Extraction Rate of Random Functionals
14:30-15:30 Keynote - Daniel Graça (Faro, Portugal) - Dynamical systems: moving from qualitative to computable results
16:30-17:30 Keynote - Jun Le Goh (Madison, USA) - Redundancy of information: lowering effective dimension