Abstract
We show that for finitely generated groups P with solvable word problem, there is no algorithm to determine whether H1(P) is trivial, nor whether H2(P) is trivial.
Original language | English |
---|---|
Pages (from-to) | 213-221 |
Number of pages | 9 |
Journal | International Journal of Algebra and Computation |
Volume | 12 |
Issue number | 1-2 |
DOIs | |
State | Published - 2002 |
Keywords
- Homology of groups
- Word problem