Dualizability of Automatic Algebras

In 2010, McNulty introduced a list of “A Dozen Easy problems”, one of which asked for a classification of dualizable finite automatic algebras. In this talk we will motivate the concept of duality, introduce the problem in question, present some partial solutions (both positive and negative), and comment on the general difficulty of the task. (joint work with B.A. Davey, J.G. Pitkethly, and R. Willard)