1. Serikzhan Badaev(Kazakh-British Technical University, Almaty, Kazakhstan):  Problems on computable numberings     

2. Sergey Goncharov(Sobolev Institute of Mathematics, Novosibirsk, Russia): Computable numberings and their Rogers semilattices

3. Victor Selivanov (A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, Russia): On some numberings in computability theory, algebra, and topology 

4. Wu Guohua(Nanyang Technological University, Singapore): Sacks Splitting Theorem revisited

5. Andrey Morozov(Sobolev Institute of Mathematics, Novosibirsk, Russia): On algebraic and algorithmic properties of some classes of functions        

6. Uri Andrews(University of Wisconsin–Madison, USA): Word problems of groups and the structure of Ceers

7. Iskander Kalimullin(Kazan Federal University, Kazan, Russia): Punctual degrees of presentability and categoricity for algebraic structures 

8. Mathieu Hoyrup(Universit´ e de Lorraine, CNRS, Inria, LORIA, Nancy, France): The fixed-point property for represented spaces.

9. Luca San Mauro(University of Bari, Italy): Exploring the learning power of Borel equivalence relations

10. Ruiwen Li (Nankai University, Tianjin, China): Equivalence Relations Inspired by the Conjugacy on Minimal Systems

11. Yang Zheng (Nankai University,Tianjin, China): On equivalence relations induced by Polish groups

12. Josiah Jacobsen-Grocott(University of Wisconsin–Madison, USA): A Ceer that is uniformly effectively inseparable but not uniformly finitely pre-complete

See the abstracts from below abstract book of the workshop