On what finitely generated (left-orderable) simple groups can know about their subgroups

In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss some new consequences and also extend some of those embedding theorems to countable classes of finitely generated groups.