Classifying word problems of finitely generated algebras via computable reducibility

Valentino Delle Rose, Luca San Mauro, Andrea Sorbi

We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the len…