Invited speakers

Invited Tutorials

• Ivan Georgiev (Sofia University, Bulgaria), Subrecursive representations of irrational numbers [abstract] [slides]

• Mathieu Hoyrup (LORIA, France), Computability of compact sets and the priority method [abstract] [slides]

• Julia Knight (University of Notre Dame, USA), Classes of algebraic structures [abstract] [slides]

• Konstantin Korovin (University of Manchester, UK), Automated Theorem Proving: SAT, SMT and Quantified First-Order Reasoning [abstract] [slides]

• Elvira Mayordomo (Universidad de Zaragoza, Spain) - declined on April 5th 2022

• Alexander Melnikov (Victoria University of Wellington, New Zealand), Effectively compact spaces with applications [abstract] [slides]

• Timur Sadykov (Plekhanov Russian University of Economics, Moscow, Russia), Analytic complexity of bivariate functions: Estimates and criteria [abstract] [slides]

• Holger Thies (Kyoto University, Japan), Certified and efficient programs from proofs in computable analysis [abstract] [slides]

• Bill Wadge (University of Victoria, Canada), Computing on the Baire space [abstract] [slides]

Invited Talks

• Matthew de Brecht (Kyoto University, Japan), Effectively extending topologies [abstract] [slides]

• Yalchin Efendiev (Texas A&M University, USA), Computations of multiscale problems [abstract] [slides]

• Marta Fiori Carones (Sobolev Institute of Mathematics, Russia), A theorem of Rival and Sands in the Weihrauch lattice [abstract] [slides]

• Su Gao (Nankai University, Tianjin, China), The Scott analysis for Boolean algebras [abstract] [slides]

• Akitoshi Kawamura (Kyoto University, Japan), A note on polynomial-time computability of compact sets [abstract] - the talk on Wednesday is cancelled

• Margarita Korovina (A.P. Ershov Institute of Informatics Systems, Russia), Ksmt calculus for non-linear systems [abstract] [slides]

• Svetlana Selivanova (Mathematical Center in Akademgorodok, Novosibirsk, Russia), Linear PDEs with variable C^1 coefficients are PSPACE-complete [abstract] [slides]

• Alexei Semenov (Lomonosov Moscow State University, Russia), On general concepts of calculus and algorithm [abstract] [slides]

• Nikolay Shilov (Innopolis University, Kazan, Russia), Approaches to formal verification of computations in machine arithmetic [abstract] [slides]

• Stanislav Speranski (Steklov Mathematical Institute, Russia), Strengthening complexity results in quantified probability logic [abstract] [slides]

• Dieter Spreen (Universität Siegen, Germany), The compact hyperspace monad: A computational approach [abstract] [slides]

• Alexander Stoimenow (KAIST, Republic of Korea), Odd crossing number amphicheiral knots [abstract] [slides]

• Xizhong Zheng (Arcadia University, USA), On the computability of planar curves and point-separability [abstract] [slides]

Contributed Talk

• Vitaly Krasikov (Plekhanov Russian University of Economics, Moscow, Russia), Computational aspects of polynomial amoebas [slides]