Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite group with solvable word problem for which there is no effective method that allows, given some non-identity element, to find a morphism onto a finite group in which this element has a non-trivial image. We also prove that the depth function of this group grows faster than any recursive function.