Punctual Copies of Algebraic Structure
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 Montalban's open problem (2013) about copyable linear orders.