For any group G, denote by e(G) the set of orders of elements in G. Given
a finite group G, let h(e(G)) be the number of isomorphism classes of finite groups with
the same set e(G) of element orders. A group G is called k-recognizable if h(e(G)) =
k < 1, otherwise G is called non-recognizable. Also a 1-recognizable group is called a
recognizable (or characterizable) group. In this paper the authors show that the simple
groups PSL(3, q), where 3 < q ±2 (mod 5) and (6, (q − 1)/2) = 1, are recognizable.