There are finitely presented groups whose word problem is undecidable in computability theory.
|
1 | [made Community Wiki] | ||
|
|
||||
|
|
1 | [made Community Wiki] | ||
|
There are finitely presented groups whose word problem is undecidable in computability theory. |
||||
