Invited speakers
Svetlana Aleksandrova (Sobolev Institute of Mathematics, Novosibirsk, Russia)
Algorithmic complexity of some aspects of Σ-definability on structures [abstract] [slides]
Lev Beklemishev (Steklov Mathematical Institute, Moscow, Russia)
Algorithmically presentable structures in proof theory [abstract]
Rod Downey (Victoria University of Wellington, New Zealand)
Some New Directions in Online Structure Theory [abstract] [slides]
Ekaterina Fokina (Technische Universität Wien, Austria)
Algorithmic learning of structures [abstract] [slides]
Sergey Goncharov (Sobolev Institute of Mathematics, Novosibirsk, Russia)
Computability and Complexity of computability over abstract structures [abstract] [slides]
Valentina Harizanov (George Washington University, USA)
Generically and coarsely computable structures and isomorphisms [abstract]
Denis Hirschfeldt (University of Chicago, USA)
The Density Metric and Computability Theory [abstract] [slides]
Bakhadyr Khoussainov (University of Electronic Science and Technology of China, Chengdu, China, and University of Auckland, New Zealand)
Probability structures [abstract] [slides]
Takayuki Kihara (Nagoya University, Japan)
Computability Theory and Reverse Mathematics via Lawvere-Tierney topologies [abstract] [slides]
Steffen Lempp (University of Wisconsin—Madison, USA)
The ∀∃-theory of the Σ^0_2-enumeration degrees [abstract] [slides]
Yuri Matiyasevich (St. Petersburg Department of Steklov Mathematical Institute, Russia)
How a computation could suggest mathematical concepts. A case study [abstract] [slides]
Manat Mustafa (Nazarbayev University, Kazakhstan)
Structural properties of Rogers Semilattices [abstract] [slides]
Keng Meng Ng (Nanyang Technological University, Singapore)
Equivalence structures and their punctual complexity [abstract] [slides]
André Nies (University of Auckland, New Zealand)
Computability for totally disconnected locally compact groups [abstract] [slides]
Victor Selivanov (A.P. Ershov Institute of Informatics Systems, Novosibirsk, Russia)
Effective Wadge Hierarchy in Computable Quasi-Polish Spaces [abstract] [slides]
Svetlana Selivanova (KAIST, Republic of Korea)
Algorithmic Complexity of Computing Solutions to Differential Equations with Analytic Inputs [abstract] [slides]
Alexei Semenov (Lomonosov Moscow State University, Russia)
Upper complete discrete structures and definability spaces [abstract] [slides]
Alexander Shen (LIRMM, France)
Kolmogorov complexity: some open questions [abstract] [slides]
Mars Yamaleev (Kazan Federal University, Russia)
The degree structures and priority arguments (Tutorial) [abstract] [slides] [whiteboard pictures]