Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation (Q3525615)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5344702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation |
scientific article; zbMATH DE number 5344702 |
Statements
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation (English)
0 references
17 September 2008
0 references
word problem
0 references
Turing machines
0 references
discrete halting problem
0 references
groups generated by uncountably many generators
0 references
computational group theory
0 references
0.9866692423820496
0 references
0.8208143711090088
0 references
0.752903163433075
0 references
0.7452077865600586
0 references
