Marat Arslanov (Kazan Federal University, Russia), Levels of nonuniformity in computability theory constructions [abstract]
Bakh Khoussainov (UESTC, China), Regular games: A playground for exponential time algorithms [abstract]
Frank Stephan (National University of Singapore, Singapore), The structures inside many-one degrees [abstract]
Noam Greenberg (Victoria University of Wellington, New Zealand), Cantor-Bendixson derivatives of uncountable structures [abstract]
Satyadev Nandakumar (Indian Institute of Technology Kanpur, India), An effective Banach-Mazur game and applications to Poincare recurrence theorem [abstract]
Vittorio Cipriani (TU Wien, Austria), Recursive aspects of unfriendly partitions [abstract]
Mathieu Hoyrup (LORIA, France), Borel complexity of continua [abstract]
Birzhan Kalmurzayev (Kazakh-British Technical University, Kazakhstan), On Rogers semilattices of families in the Ershov hierarchy [abstract]
Dariusz Kalociński (Institute of Computer Science, Polish Academy of Sciences, Poland), Representational invariance for primitive recursion [abstract]
Heer Tern Koh (UESTC, China), A Weihrauch perspective on categoricity problems [abstract]
Ruslan Kornev (Sobolev Institute of Mathematics, Russia), Elementary theory of the group of computable automorphisms of the reals [abstract]
Isabella Scott (University of Wisconsin-Madison, USA), Integrals of countable graphs and linear orders [abstract]
Invited talks will be one hour long (including time for questions).