1. I. Sh. Kalimullin, A. G. Melnikov, and K. M. Ng, ‘‘Algebraic structures computable without delay,’’ Theor. Comput. Sci. 674, 73–98 (2017).
2. P. E. Alaev, ‘‘Polynomially computable structures with finitely many generators,’’ Algebra Logic 59, 266–272 (2020).
3. N. A. Bazhenov, R. G. Downey, A. G. Melnikov, and I. Sh. Kalimullin, ‘‘Foundations of online structure theory,’’ Bull. Symb. Log. 25, 141–181 (2019).
4. R. I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets (Springer, Berlin, 1987).
5. N. A. Bazhenov, R. G. Downey, A. G. Melnikov, and I. Sh. Kalimullin, ‘‘Foundations of online structure theory,’’ Bull. Symb. Log. 25, 141–181 (2019).