  We show that every countable group H with solvable word problem (=computable
group) can be subnormally embedded into a 2-generated group G which also has
solvable word problem. Moreover, the membership problem for H < G is also
solvable. We also give estimates of time and space complexity of the word
problem in G and of the membership problem for H < G.
