This workshop will be held as a part of the JSPS-RFBR Bilateral Joint Research Project "Effective Descriptive Set Theory, Computable Analysis, and Automata".

=> Abstracts are available here.

All times are in JST (Japan Standard Time). E.g. 14:30 in JST = 12:30 in Novosibirsk = 8:30 in St. Petersburg.

Mar 17

• 14:20 -- 14:30 (Opening)

• 14:30 -- 15:30 Victor Selivanov, Effective Wadge hierarchy in computable quasi-Polish spaces [slides]

• 15:30 -- 16:30 Mizuhito Ogawa, On classes of regular languages related to monotone WQOs [slides]

(Coffee Break)

• 17:00 -- 18:00 Svetlana Selivanova, Bit-complexity of computing solutions of linear hyperbolic partial differential equations with guaranteed precision [slides]

• 18:00 -- 19:00 Alexander Okhotin, Determinization of event-clock input-driven pushdown automata

Mar 18

• 14:00 -- 14:40 Kenta Sasaki, A generalization of Louveau's separation theorem for Wadge classes of bqo-valued Borel functions

• 14:40 -- 15:20 Ruslan Kornev, Degrees of metrics under computable reducibility [slides]

• 15:30 -- 16:30 Takako Nemoto, Determinacy of Wadge classes and subsystems of second order arithmetic [slides]

(Coffee Break)

• 17:00 -- 18:00 Akitoshi Kawamura, Average-case polynomial-time computability of Hamiltonian dynamics

• 18:00 -- 19:00 Ryoma Sin'ya, Measure theoretic approach to formal language theory [slides]

Mar 19

• 14:30 -- 15:30 Takayuki Kihara, Around the Wadge rank ω_2 [slides]

• 15:30 -- 16:30 Margarita Korovina and Oleg Kudinov, Some properties of complexity classes over real numbers

(Coffee Break)

• 17:00 -- 18:00 Matthew de Brecht, Representing quasi-Polish spaces as spaces of ideals, with applications to computable topology [slides]

• 18:00 -- 19:00 Keita Yokoyama, On the unique existence conservation theorem for WKL [slides]