MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Can anyone help to find some information about these structures?

share|cite|improve this question
What is "algorithmically finite-dimensional algebra"? – Boris Novikov Mar 21 '13 at 17:17
A Google search for the term finds only this question. -- Maybe you could clarify what you are looking for. – Stefan Kohl Mar 21 '13 at 17:21
Possibly the term resulted from a translation from Russian(?) – Stefan Kohl Mar 21 '13 at 17:23
Yep. I translated it from Russian. So: 1. algorithmically finite (for groups) means that there is no algorithm for figuring infinite number of non-equal elements. 2. for algebras we consider this property as a algorithmically finite dimension. – Ayrana Mongush Mar 21 '13 at 17:45
it's obvious for finite groups and algebras (and any other structures), but the point is that they should be infinite – Ayrana Mongush Mar 21 '13 at 17:51
up vote 1 down vote accepted

All what I could found is a talk of Bakhadyr Khoussainov

in which he considered "algorithmically finite universal algebras". Maybe this will useful for you.

share|cite|improve this answer
Thank you. Спасибо) I'll look it through. – Ayrana Mongush Mar 21 '13 at 20:48

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.