Algorithmic problems in associative algebras (Q1346910)
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 738958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic problems in associative algebras |
scientific article; zbMATH DE number 738958 |
Statements
Algorithmic problems in associative algebras (English)
0 references
20 April 1995
0 references
The author proves that the occurrence problem for free algebras in the variety of algebras obeying the identity \([x_1,x_2][x_3,x_4][x_5,x_6][x_7,x_8]=0\) is undecidable. The next result is that there is no algorithm determining whether or not a finite system of elements in a free associative algebra is algebraically dependent. And the last result is that there exists a f.g. associative algebra with undecidable word problem, such that its relation module is free. These undecidability results are proven by interpretation of two-tape Minsky machines. In the proof of the second result the cycles in these machines are studied and interpreted as dependences in algebras.
0 references
algorithmic problems
0 references
algebraic dependence
0 references
occurrence problem
0 references
free algebras
0 references
variety of algebras
0 references
undecidable word problem
0 references
relation modules
0 references
undecidability results
0 references
two-tape Minsky machines
0 references
0.8115358352661133
0 references
0.7977247834205627
0 references
0.7924692034721375
0 references
0.7839068174362183
0 references
