
We construct a finitely based variety of algebras with two binary operations where the set of subalgebras of finite simple algebras is not recursive.
finite simple algebras, binary operations, Word problems (aspects of algebraic structures), unsolvability of algorithmic problems, finitely based variety of algebras, subalgebras, Word problems, etc. in computability and recursion theory
finite simple algebras, binary operations, Word problems (aspects of algebraic structures), unsolvability of algorithmic problems, finitely based variety of algebras, subalgebras, Word problems, etc. in computability and recursion theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
