Output details
11 - Computer Science and Informatics
University of Edinburgh
A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM
<10> Originality: The paper establishes a way in which the conjugacy problem for finitely presented groups can be almost solvable but in fact unsolvable by introducing a rather novel notion of computation.
Significance: Under appropriate conditions there is a correspondence between the notions introduced and computation by modular machines (hence Turing machines). This extended model makes the derivation of some properties easier than usual. Work in this area is very technical, the novel computational model could well have applications elsewhere.
Rigour: Fully refereed and published in an international journal; all proofs and constructions are provided in full in the paper.