Conferences
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  

Fourth Workshop on Digitalization and Computable Models (WDCM-2022)
(October 24–29, 2022, Novosibirsk and Kazan)

The main goals of the WDCM workshop 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.

Website: https://sites.google.com/view/wdcm-2022/home

Program

Program Committee
Arslanov Marat Mirzaevich
Bazhenov Nikolay Alekseevich
Goncharov Sergey Savostyanovich
Kalimullin Iskander Shagitovich
Mel'nikov Aleksandr Gennad'evich
Miller Russell
Selivanov Viktor L'vovich
Selivanova Svetlana Viktorovna

Institutions
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Kazan (Volga Region) Federal University


Fourth Workshop on Digitalization and Computable Models (WDCM-2022), Novosibirsk and Kazan, October 24–29, 2022

October 24, 2022 (Mon)
1. Opening
October 24, 2022 08:50–09:00, Novosibirsk and Kazan
2. The Scott rank of computable structures and the isomorphism relation
Su Gao
October 24, 2022 09:00–10:00, Novosibirsk and Kazan
  
3. Primitive recursive reverse mathematics
Marta Fiori Carones
October 24, 2022 10:00–11:00, Novosibirsk and Kazan
  
4. "Jump inversion" for linear orders
Maxim Zubkov
October 24, 2022 17:00–18:00, Novosibirsk and Kazan
  
5. Computability-theoretic reduction games in reverse mathematics
Denis Hirschfeldt
October 24, 2022 18:00–19:00, Novosibirsk and Kazan
  

October 25, 2022 (Tue)
6. Some applications of recursion theory to geometric measure theory
Liang Yu
October 25, 2022 09:00–10:00, Novosibirsk and Kazan
  
7. Does subclass of left-c.e. supermartingales define 1-randomness
Lu Liu
October 25, 2022 10:00–11:00, Novosibirsk and Kazan
  
8. Well orderings of graphs
Reed Solomon
October 25, 2022 17:00–18:00, Novosibirsk and Kazan
  
9. Toward deciding the $\forall\exists$-theory of the $\Sigma^0_2$-enumeration degrees
Steffen Lempp
October 25, 2022 18:00–19:00, Novosibirsk and Kazan
  

October 26, 2022 (Wed)
10. Kleene star in substructural logics
Stepan Kuznetsov
October 26, 2022 09:00–10:00, Novosibirsk and Kazan
  
11. Complexity for Kripke’s theory of truth
Stanislav Speranski
October 26, 2022 10:00–11:00, Novosibirsk and Kazan
  
12. Majority circuits and sorting networks of small depth
Vladimir Podolskii
October 26, 2022 17:00–18:00, Novosibirsk and Kazan
  
13. Generic Muchnik reducibility
Joseph Miller
October 26, 2022 18:00–19:00, Novosibirsk and Kazan
  

October 27, 2022 (Thu)
14. On holographic structures
Andrey Morozov
October 27, 2022 09:00–10:00, Novosibirsk and Kazan
  
15. On the complexity of the Quantified Constraint Satisfaction Problem
Dmitry Zhuk
October 27, 2022 10:00–11:00, Novosibirsk and Kazan
  
16. Fields computable in polynomial time
Pavel Alaev
October 27, 2022 11:10–11:55, Novosibirsk and Kazan
  
17. First-order classification and non-standard models
Alexei Miasnikov
October 27, 2022 17:00–18:00, Novosibirsk and Kazan
  
18. Computable families of sets and numberings
Iskander Kalimullin
October 27, 2022 18:05–18:50, Novosibirsk and Kazan
  

October 28, 2022 (Fri)
19. Computability in $C[0,1]$
Alexander Melnikov
October 28, 2022 08:00–08:45, Novosibirsk and Kazan
  
20. Recent developments on the Wadge degrees of Borel functions
Takayuki Kihara
October 28, 2022 08:45–09:30, Novosibirsk and Kazan
  
21. Formal grammars after the Cuban missile crisis
Alexander Okhotin
October 28, 2022 09:40–10:25, Novosibirsk and Kazan
  
22. On the complexity of describing topological bases for $QCB_0$-spaces
Matthew de Brecht
October 28, 2022 16:00–16:45, Novosibirsk and Kazan
23. Describing the Wadge hierarchy on arbitrary zero-dimensional Polish spaces
Luca Motto Ros
October 28, 2022 16:45–17:30, Novosibirsk and Kazan
  
24. Putting the fun back in functional programming
Bill Wadge
October 28, 2022 17:40–18:25, Novosibirsk and Kazan
  

October 29, 2022 (Sat)
25. Fine hierarchy relative to Turing reducibility
Mars Yamaleev
October 29, 2022 08:45–09:30, Novosibirsk and Kazan
  
26. Rigorous computation of solutions to differential equations problems, and algorithmic complexity
Svetlana Selivanova
October 29, 2022 09:30–10:15, Novosibirsk and Kazan
  
27. Normal numbers and perfect necklaces
Veronica Becher
October 29, 2022 16:00–16:45, Novosibirsk and Kazan
28. On partial numberings
Dieter Spreen
October 29, 2022 16:45–17:30, Novosibirsk and Kazan
  
29. A Mathematical Journey
Victor Selivanov
October 29, 2022 17:40–18:20, Novosibirsk and Kazan
  
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024