2
$\begingroup$

Can anyone help to find some information about these structures?

$\endgroup$
7
  • 1
    $\begingroup$ What is "algorithmically finite-dimensional algebra"? $\endgroup$ Mar 21, 2013 at 17:17
  • $\begingroup$ A Google search for the term finds only this question. -- Maybe you could clarify what you are looking for. $\endgroup$
    – Stefan Kohl
    Mar 21, 2013 at 17:21
  • $\begingroup$ Possibly the term resulted from a translation from Russian(?) $\endgroup$
    – Stefan Kohl
    Mar 21, 2013 at 17:23
  • $\begingroup$ 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. $\endgroup$ Mar 21, 2013 at 17:45
  • $\begingroup$ it's obvious for finite groups and algebras (and any other structures), but the point is that they should be infinite $\endgroup$ Mar 21, 2013 at 17:51

1 Answer 1

1
$\begingroup$

All what I could found is a talk of Bakhadyr Khoussainov

http://www.math.nsc.ru/conference/malmeet/11/plenary/2011MM_Khoussainov.ppt

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

$\endgroup$
0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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