Invited Speakers

The recordings of the talks.


The computable strength of Milliken's Tree Theorem and applications. [abstract] [slides]

Duality in Weihrauch complexity [abstract] [slides]

Bi-embeddability and computable structures [abstract] [slides]

A dynamic taxonomy of Borel Wadge classes [abstract] [slides]

Descriptive complexity of topological invariants [abstract] [slides]

Lawvere-Tierney topologies for computability theorists [abstract] [slides]

The ksmt for solving non-linear constraints [abstract]

Complexity of root-taking in power series fields & related problems [abstract] [slides]

Are the rationals dense? [abstract]

Duality between topological groups and approximation groupoids [abstract] [slides]

Recent studies on formal languages over GF(2) [abstract] [slides]

Classifications of Ramsey-like theorems [abstract] [slides]

A computable analysis perspective on (verified) machine learning [abstract] [slides]

Complexity classification of linear partial differential equations [abstract] [slides]

Definability theory. Geometry view and open problems [abstract] [slides]

Automatic complexity, normality and finite-state dimension revisited [abstract] [slides]

The e-verse [abstract] [slides]

A survey of the structures realised by positive equivalence relations [abstract] [slides]

Existential properties in algebraic extensions of the rationals [abstract] [slides]

Logic in Computer Science for Continuous Data [abstract]