Invited Speakers

• Pavel Alaev (Sobolev Institute of Mathematics, Russia), Fields computable in polynomial time [abstract]

• Veronica Becher (Universidad de Buenos Aires, Argentina), Normal numbers and perfect necklaces [abstract] [slides]

• Matthew de Brecht (Kyoto University, Japan), On the complexity of describing topological bases for QCB0-spaces [abstract] [slides]

• Iskander Kalimullin (Kazan Federal University, Russia), Computable families of sets and numberings [abstract] [slides]

• Takayuki Kihara (Nagoya University, Japan), Recent developments on the Wadge degrees of Borel functions [abstract] [slides]

• Alexander Melnikov (Victoria University of Wellington, New Zealand), Computability in C[0,1] [abstract] [slides]

• Luca Motto Ros (University of Turin, Italy), Describing the Wadge hierarchy on arbitrary zero-dimensional Polish spaces [abstract] [slides]

• Alexander Okhotin (St. Petersburg State University, Russia), Formal grammars after the Cuban missile crisis [slides]

• Victor Selivanov (A.P. Ershov Institute of informatics Systems, Russia), A Mathematical Journey [abstract] [slides]

• Svetlana Selivanova (KAIST, Republic of Korea, and Sobolev Institute of Mathematics, Russia), Rigorous computation of solutions to differential equations problems, and algorithmic complexity [abstract] [slides]

• Dieter Spreen (Universität Siegen, Germany), On partial numberings [abstract] [slides]

• Bill Wadge (University of Victoria, Canada), Putting the fun back in functional programming [abstract] [slides]

• Mars Yamaleev (Kazan Federal University, Russia), Fine hierarchy relative to Turing reducibility [abstract] [slides]

Organizers

• Nikolay Bazhenov (Sobolev Institute of Mathematics, Russia)

• Takayuki Kihara (Nagoya University, Japan)

• Svetlana Selivanova (KAIST, Republic of Korea, and Sobolev Institute of Mathematics, Russia)