# Talks

## Invited talks

(06/2022)

**Computable reductions of equivalence relations**Tutorial for*Logic Colloquium 2022*, Reykjavik University(03/2021)

**Classifying word problems***Computability Theory and Applications Online Seminar*(12/2020)

**Revisiting the complexity of word problems***Torino-Udine Logic seminar*(06/2020)

**Learning algebraic structures***Computability in Europe 2020*, special session on “Algorithmic Learning Theory”, University of Salerno(06/2020)

**Word problems and ceers***Reverse mathematics, numberings, and equivalence relations*workshop(02/2020)

**Beyond isomorphism: The interplay between structures and computation***Structuralist Foundations*workshop, University of Vienna(12/2019)

**The global structure of degrees of equivalence relations***First Workshop on Digitalization and Computable Models*, Novosibirsk State University(12/2019)

**The complexity of punctual equivalence relations***Studies in Mathematical Logic*workshop, University of São Paulo(06/2019)

**Computable reducibility and its variants***Computability, Complexity, and Randomness 2019*, Nazarbayev University, Nur-Sultan

## Contributed talks

**42**contributed talks given, including several editions of*Logic Colloquium*,*Computability in Europe*, and*Computability, Complexity and Randomness*

## SEMINAR talks

University of Konstanz, University of Padua, University of Wisconsin-Madison, University of Pavia, Sobolev Institute of Mathematics (Novosibirsk), Vita-Salute San Raffaele University (Milan), Hasso Plattner Institute (Potsdam), University of Campinas, University of Bologna, University of Urbino, University of Buenos Aires