The goal of this paper is to survey, in a uniform and systematic way, the main results regarding networks of evolutionary processors reported so far. First, we recall the results concerning the computational power of these networks viewed as language generating devices. Then, we briefly present a few NP-complete problems and recall how they were solved in linear time by networks of evolutionary processors with linearly bounded resources (nodes, ruIes, symbols).