The unsolvability of the conjugacy problem for finitely presented groups was first shown by Novikov [26]. Shortly thereafter the corresponding result for the word problem was proved by Novikov [27] and Boone [6] (see also Boone [7], Higman [20] and Britton [9]). Friedberg [19] and Mucnik [25] revitalised the theory of recursively enumerable (r.e.) Turing… (More)

@inproceedings{Kalorkoti2001TuringDA,
title={Turing Degrees and the Word and Conjugacy Problems for Finitely Presented Groups},
author={K. Kalorkoti},
year={2001}
}