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 this page instead for the normal view: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation |
scientific article |
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
