## Logic Seminar

Sumun IyerCornell University
The groups of Richard Thompson and complexity, part 1
Tuesday, October 5, 2021 - 2:45pm
Malott 206

This talk will cover theorems of Birget about decidability and complexity of problems related to Thompson's group $V$. Some results include determining the parallel complexity classes for the composition problem and word problem in $V$ as well as giving bounds on the time complexity of the word problem in $V$. We will also consider the complexity of some generalized word problems in $V$.