The First Workshop on Digitalization and Computable Models
The First Workshop on Digitalization and Computable Models (WDCM-2019) initiates a new series of meetings, which is organized by the Mathematical Center in Akademgorodok (the consortium consisting of Sobolev Institute of Mathematics and Novosibirsk State University). WDCM-2019 is supported by Ministry of Education and Science of the Russian Federation agreement №075-15-2019-1675.
The main goals of the series include:
- Providing a venue for leading researchers in computability theory and computer science to meet and discuss the latest trends in their areas.
- Providing an opportunity for younger researchers to present their work.
- Encouraging joint projects of interdisciplinary nature.
WDCM-2019 will take place on December 16-20, 2019 in Novosibirsk, Russia.
The venue is Sobolev Institute of Mathematics.
Please see the schedule.
- Pavel Alaev (Sobolev Institute of Mathematics), Finitely generated structures computable in polynomial time
- Svetlana Aleksandrova (Sobolev Institute of Mathematics), Hereditarily finite and list superstructures
- Rachael Alvir (University of Notre Dame, USA), Scott sentences: History and Motivation
- Serikzhan Badaev (Kazakh-British Technical University, Almaty, Kazakhstan), On minimal numberings in the Ershov hierarchy
- Marat Faizrakhmanov (Kazan Federal University, Russia), Computability on families
- Iskander Kalimullin (Kazan Federal University, Russia), Primitive recursively categorical semigroups
- Margarita Marchuk (Sobolev Institute of Mathematics), Computable characterization for decidably categorical and computably categorical structures
- Manat Mustafa (Nazarbayev University, Nur-Sultan, Kazakhstan), Structural properties of Rogers semilattices
- Vadim Puzarenko (Sobolev Institute of Mathematics), Friedberg presentations in
- Dino Rossegger (University of Waterloo, Canada), Analytic complete equivalence relations and their degree spectra
- Luca San Mauro (Technische Universität Wien, Vienna, Austria), The global structure of countable equivalence relations
- Stefan Vatev (Sofia University «St. Kliment Ohridski», Sofia, Bulgaria), Computable embeddings for classes of structures
- Mars Yamaleev (Kazan Federal University, Russia), Definability and degree structures in the Ershov hierarchy
- Maxim Zubkov (Kazan Federal University, Russia), Computable linear orders and their isomorphisms
- Sergey Goncharov (the chair of the programme committee), Sobolev Institute of Mathematics
- Marat Arslanov, Kazan Federal University, Russia
- Valentina Harizanov, George Washington University, USA
- Matthew Harrison-Trainor, Victoria University of Wellington, New Zealand
- Julia Knight, University of Notre Dame, USA
- Churn-Jung Liau, Institute of Information Science, Academia Sinica, Taiwan
- Alexander Melnikov, Massey University, New Zealand
- Andrey Morozov, Sobolev Institute of Mathematics
- Keng Meng Ng, Nanyang Technological University, Singapore
- Victor Selivanov, A.P. Ershov Institute of Informatics Systems, Russia
- Yue Yang, National University of Singapore, Singapore
- Nikolay Bazhenov (the secretary of the programme committee), Sobolev Institute of Mathematics
Please see: Visa policy of Russia.
There are direct flights from Almaty, Bangkok, Beijing, Dubai, Hong Kong, Kazan, Moscow, Nur-Sultan, Seoul, St. Petersburg, Tokyo, and other cities to Novosibirsk Tolmachevo Airport.
Nikolay Bazhenov, bazhenov [at] math.nsc.ru