Seminar: What is ... a group with insolvable word problem?

Joshua Hunt will give a talk outlining how to construct a group with insolvable word problem, using Turing machines. If time permits, he will explain how the existence of this group shows that lots of other properties of groups are algorithmically unrecognisable, and use the constructions involved to show the existence of Higman's universal finitely presented group.

This lecture is part of the  "What is..?" seminar.