Title:Detecting Nilpotence in Classes of Groups
Speaker: Iva Bilanovic, GWU
Date and Time: Friday, March 30, 2018 11:00AM-12::00 PM
Place: Phillips Hall (801 22nd Street), Room 736
Abstract: Detecting an arbitrary Markov property is π2-hard in the class of recursively presented groups and is π1-hard in the class of computable groups. In other words, even when a computable description of a group is given we cannot algorithmically decide whether the group has some property. Certain properties attain even higher level of complexity. We will investigate nilpotence and precisely locate its undecidability in the arithmetical hierarchy.