Talk:Combinatorial group theory

Burnside problem
"It also comprises a number of algorithmically insoluble problems, most notably the word problem for groups; and the classical Burnside problem" : ? On the page Burnside's problem : "the word and conjugacy problems were shown to be effectively solvable in B(m, n)" Anne Bauval (talk) 08:31, 24 October 2012 (UTC)