Output details
11 - Computer Science and Informatics
University of Edinburgh
Article title
A FINITELY PRESENTED GROUP WITH ALMOST SOLVABLE CONJUGACY PROBLEM
Type
D - Journal article
Title of journal
Asian-European Journal of Mathematics
Article number
-
Volume number
2
Issue number
4
First page of article
611
ISSN of journal
1793-5571
Year of publication
2009
Number of additional authors
0
Additional information
<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.
Interdisciplinary
-
Cross-referral requested
-
Research group
F - Laboratory for Foundations of Computer Science
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
