Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (Q4304125)
From MaRDI portal
scientific article; zbMATH DE number 635986
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups |
scientific article; zbMATH DE number 635986 |
Statements
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (English)
0 references
24 November 1994
0 references
word problems for groups
0 references
pseudo-natural algorithm
0 references
complexity
0 references
halting problem
0 references
modular machines
0 references
Turing machines
0 references
