We systematise notions and techniques needed for development of the computable structure theory towards applications such as symbolic algorithms and on-line algorithms. On this way, we introduce some new notions and investigate their relation to the already existing ones. In particular, in the context of polynomial-time presentability such relation turns out to depend on complexity-theoretic conjectures like P = NP.