BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Giles Gardam (University of Münster) DTSTART:20211005T050000Z DTEND:20211005T063000Z DTSTAMP:20260412T203931Z UID:SAGO/11 DESCRIPTION:Title: So lving semidecidable problems in group theory\nby Giles Gardam (Univers ity of Münster) as part of Algebra Seminar (presented by SMRI)\n\n\nAbstr act\nGroup theory is littered with undecidable problems. A classic example is the word problem: there are groups for which there exists no algorithm that can decide if a product of generators represents the trivial element or not. Many problems (the word problem included) are at least semidecida ble\, meaning that there is a correct algorithm guaranteed to terminate if the answer is "yes"\, but with no guarantee on how long one has to wait. I will discuss strategies to try and tackle various semidecidable problems computationally with the key example being the discovery of a counterexam ple to the Kaplansky unit conjecture.\n\nBiography: Giles Gardam is a rese arch associate at the University of Münster working in geometric group th eory. He studied mathematics and computer science at the University of Syd ney\, receiving his Bachelor's degree in 2012\, and completed his doctorat e at Oxford in 2017. He was then a postdoc at the Technion before starting at Münster in 2019.\n LOCATION:https://researchseminars.org/talk/SAGO/11/ END:VEVENT END:VCALENDAR