Submission date: 15 August 2017

Abstract:

[Communications in Algebra, 2015; DOI: 10.1080/00927872.2014.955579]

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.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 1708.04397: pdf, ps.