Computability learning seminar

Chris Conidis, Pure Mathematics Department, University of Waterloo

"The Complexity of Ascendant Sequences in Locally Nilpotent Groups"

We will give a computably enumerable construction of ascendant sequences in locally nilpotent groups via P. Hall's Collection Process for nilpotent groups.