Punctual copies of algebraic structures

We estimate the complexity of constructing a punctual “online” copy of an algebraic structure. We establish a general upper bound as well as optimal bounds for classes of Boolean algebras, abelian p-groups, and linear orders. Moreover, the methods developed here are applied to solving MontalbГЎn’s open problem (2013) about copyable linear orders.