Decision problems and profinite completions of groups. (Q2431534)

Let \(P\to\Gamma\) be an embedding of finitely presented groups that induces the isomorphism \(\widehat P\to\widehat\Gamma\) of their profinite completions. The author proves that the conjugacy problem and the isomorphism problem for such a pair \((P,\Gamma)\) are unsolvable. He also proves that for a super-perfect group \(G\) having a compact classifying space and no proper subgroups of finite index there is no algorithm deciding triviality of \(G\).