  We answer two questions on the complexities of decision problems of groups,
each related to a classical result. First, C. Miller characterized the
complexity of the isomorphism problem for finitely presented groups in 1971. We
do the same for the isomorphism problem for recursively presented groups.
Second, the fact that every Turing degree appears as the degree of the word
problem of a finitely presented group is shown independently by multiple people
in the 1960s. We answer the analogous question for degrees of ceers instead of
Turing degrees. We show that the set of ceers which are computably equivalent
to a finitely presented group is $\Sigma^0_3$-complete, which is the maximal
possible complexity.
