Adian–Rabin theorem
= Adian–Rabin theorem
{c}
{wiki}
No <Markov property of finitely presented groups> is decidable by an algorithm taking an arbitrary <finite group presentation> as input. The proof reduces the <word problem for a group> to property recognition using an effective construction which collapses when an input word is trivial and embeds the input group when it is nontrivial.