We consider finitely generated structures computable in polynomial time. A general description is found for the class, and this decription is applied to a few standard algebraic classes such as finitely generated semigroups, groups, commutative rings and fields. For each class, a simple description is also found.